Loading...
Please wait, while we are loading the content...
Similar Documents
Deriving monad transformers
| Content Provider | Semantic Scholar |
|---|---|
| Author | Hinze, Ralf |
| Copyright Year | 1999 |
| Abstract | In a paper about pretty printing J. Hughes introduced two fundamental techniques for deriving programs from their speciication, where a speciication consists of a signature and properties that the operations of the signature are required to satisfy. Very brieey, the rst technique, the term implementation, represents the operations by terms and works by deening a mapping from operations to observations | this mapping can be seen as deening a simple interpreter. The second, the context-passing implementation, represents operations as functions from their calling context to observations. We apply both techniques to derive among others a backtracking monad transformer which adds backtracking to an arbitrary monad. In addition to the usual backtracking operations | failure and nondeterministic choice | the prolog cut and an operation for delimiting the eeect of a cut are supported. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://www.informatik.uni-bonn.de/~ralf/MonadT.ps.gz |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
