Abstract

In a paper about pretty printing J. Hughes introduced two fundamental techniques for deriving programs from their specication, where a specication consists of a signature and properties that the operations of the signature are required to satisfy. Briey, the rst technique, the term implementation, represents the operations by terms and works by dening a mapping from operations to observations | this mapping can be seen as dening 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 a backtracking monad transformer that 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 eect of a cut are supported. Categories and Subject Descriptors D.1.1 [Programming Techniques]: Applicative (Functional) Programming; D.3.2 [Programming La...

Citations

1225	The essence of functional programming - Wadler - 1992
723	Rewrite systems - Dershowitz, Jouannaud - 1990
651	Notions of computation and monads - Moggi - 1991
418	Comprehending monads - Wadler - 1990
213	Monad transformers and modular interpreters - Liang, Hudak, et al. - 1995
200	Introduction to functional programming using Haskell - Bird - 1998
168	The Art of Prolog: Advanced Programming Techniques - Sterling, Shapiro - 1986
154	An abstract view of programming languages - Moggi - 1990
75	The design of a pretty-printing library - Hughes - 1995
64	Composing monads - Jones, Duponcheel - 1993
42	Calculating compilers - Meijer - 1992
33	Continuation semantics for Prolog with cut - Bruin, Vink - 1989
10	Prolog’s control constructs in a functional setting: Axioms and implementation - Hinze
8	Simple Operational and Denotational Semantics for Prolog with Cut - Billaud - 1990
6	An extension of ML with abstract types - Odersky, Laufer - 1992