Relating models of backtracking

Proceedings of the ACM SIGPLAN International Conference on Functional Programming, ICFP

Volumn , Issue , 2004, Pages 54-65

  Wand, Mitchell ^a   Vaillancourt, Dale ^a  

^a Northeastern University   (United States)

Author keywords

Adequacy; Logical relations; Monads; Streams; Two continuation semantics

Indexed keywords

CALCULATIONS; COMPUTATIONAL METHODS; COMPUTER PROGRAMMING LANGUAGES; EMBEDDED SYSTEMS; FORMAL LOGIC; MATHEMATICAL MODELS; PROBLEM SOLVING;

ADEQUACY; LOGICAL RELATIONS; MONADS; STREAMS; TWO-CONTINUATION SEMANTICS;

SEMANTICS;

EID: 13344295037     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1016850.1016861     Document Type: Conference Paper

References (22)

1. Hal Abelson and Gerald Jay Sussman. The Structure and Interpretation of Computer Programs. MIT Press, Cambridge, MA, 1985.
2. Rod M. Burstall and John Darlington. A transformation system for developing recursive programs. Journal of the ACM, 24:44-67, 1977.
3. R. L. Crole and A. D. Gordon. Factoring an Adequacy Proof. In C. J. van Rijsbergen, editor, FP'93 Glasgow Workshop on Functional Programming, Workshops in Computing, pages 9-25. Springer-Verlag, 1994.
4. Olivier Danvy, Bernd Grobauer, and Morten Rhiger. A unifying approach to goal-directed evaluation. New Generation Computing, 20:53-73, 2002.
5. Scott Federhen. A mathematical semantics for PLANNER. Master's thesis, University of Maryland, 1980.
6. Matthias Felleisen, Mitchell Wand, Daniel P. Friedman, and Bruce Duba. Abstract continuations: A mathematical semantics for handling functional jumps. In Proceedings of the 1988 ACM Symposium on LISP and Functional Programming, Salt Lake City, Utah, July 1988.
7. Ralf Hinze. Deriving backtracking monad transformers. In Proc. ACM SIGPLAN International Conference on Functional Programming, pages 186-197, 2000.
8. John Hughes. The design of a pretty-printing library. In J. Jeuring and E. Meijer, editors, Advanced Functional Programming, volume 925. Springer Verlag, 1995.
9. K. M. Kahn and M. Carlsson. How to implement prolog on a LISP machine. In J. A. Campbell, editor, Implementations of Prolog, pages 119-134. Chichester, 1984.
10. Samuel Kamin. Final data type specifications: A new data type specification method. In Conf. Rec. 7th ACM Symposium on Principles of Programming Languages, pages 131-138, 1980.
11. John C. Mitchell. Foundations for Programming Languages. MIT Press, Cambridge, MA, 1996.
12. Eugenio Moggi. Notions of computation and monads. Information and Computation, 93(1):55-92, 1991.
13. Gordon D. Plotkin. LCF considered as a programming language. Theoretical Computer Science, 5:223-255, 1977.
14. David Sands. Total correctness by local improvement in the transformation of functional programs. ACM Transactions on Programming Languages and Systems, 18(2):175-234, March 1996.
15. Silvija Seres, J. Michael Spivey, and C. A. R. Hoare. Algebra of logic programming. In International Conference on Logic Programming, pages 184-199, 1999.
16. Silvija Seres and Michael J. Spivey. Embedding prolog into haskell. In Haskell Workshop '99, 1999.
17. Hayo Thielecke. From control effects to typed continuation passing. In Conf. Rec. 30th ACM Symposium on Principles of Programming Languages, pages 139-149. ACM Press, 2003.
18. A. S. Troelstra, editor. Metamathematical Investigation of Intuitionistic Arithmetic and Analysis, volume 344 of Lecture Notes in Mathematics. Springer-Verlag, Berlin, Heidelberg, and New York, 1973.
19. P. L. Wadler. How to replace failure by a list of successes. In Jean-Pierre Jouannaud, editor, Functional Programming Languages and Computer Architecture, volume 201 of Lecture Notes in Computer Science, pages 113-128. Springer Verlag, September 1985.
20. Christopher P. Wadsworth. Some unusual λ-calculus numeral systems. In J. R. Seldin and J. P. Hindley, editors, To H.B. Curry: Essays on Combinatory Logic, Lambda-Calculus and Formalism, pages 215-230. Academic Press, New York and London, 1980.
21. Mitchell Wand. Final algebra semantics and data type extensions. Journal of Computer and Systems Science, 19:27-44, 1979.
22. Glynn Winskel. The Formal Semantics of Programming Languages. MIT Press, Cambridge, MA, 1993.