PROLOG'S control constructs in a functional setting - Axioms and implementation

International Journal of Foundations of Computer Science

Volumn 12, Issue 2, 2001, Pages 125-170

  Hinze, Ralf ^a  

^a UNIVERSITY OF BONN   (Germany)

Author keywords

axiomatic semantics; continuations; Haskell; monad transformers; monads; Prolog

Indexed keywords

EID: 11444263063     PISSN: 01290541     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0129054101000436     Document Type: Article

References (46)

1. James Andrews. A paralogical semantics for the Prolog cut. In John Lloyd, editor, Proceedings of the International Symposium on Logic Programming, pages 591-608, Cambridge, December 1995. MIT Press.
2. A. W. Appel and D. B. MacQueen. Standard ML of New Jersey. In J. Maluszyriski and M. Wirsing, editors, Programming Language Implementation and Logic Programming (PLILP), number 528 in Lecture Notes in Computer Science, pages 1-13. Springer-Verlag, 1991.
3. Bijan Arbab and Daniel M. Berry. Operational and denotational semantics of Prolog. Journal of Logic Programming, 4(4):309-329, December 1987.
4. Michel Billaud. Simple operational and denotational semantics for Prolog with cut. Theoretical Computer Science, 71(2):193-208, March 1990.
5. Bird and R. S. The promotion and accumulation strategies in transformational programming. ACM Transactions on Programming Languages and Systems, 6(4):487-504, October 1984.
6. Egon Borger and Dean Rosenzweig. A mathematical definition of full Prolog. Science of Computer Programming, 24(3):249-286, June 1995.
7. Mats Carlsson. On implementing Prolog in functional programming. New Generation Computing, 2:347-359, 1984.
8. Olivier Danvy and Andrzey Filinski. Abstracting control. In Proceedings of the 1990 ACM Conference on LISP and Functional Programming, June 1990, Nice, pages 151-160. ACM-Press, June 1990.
9. A. de Bruin and E.P. de Vink. Continuation semantics for prolog with cut. In J. Diaz and F. Orejas, editors, Proceedings of the International Joint Conference on Theory and Practice of Software Development : Vol. 1, volume 351 of Lecture Notes in Computer Science, pages 178-192, Berlin, March 1989. Springer-Verlag.
10. David A. Espinosa. Semantic Lego. Ph.d. thesis, Columbia University, 1995.
11. Y. Gurevich. Evolving algebras. A tutorial introduction. Bulletin of EATCS, 43:264-284, 1991.
12. Michael Hanus. Horn clause programs with polymorphic types: semantics and resolution. Theoretical Computer Science, 89(1):63-106, October 1991.
13. Michael Hanus. The integration of functions into logic programming: From theory to practice. Journal of Logic Programming, 19&20:583-628, 1994.
14. P. H. Hartel. Benchmarking implementations of lazy functional languages II-two years later. Technical Report CS-94-21, Dept. of Comp. Sys, Univ. of Amsterdam, December 1994.
15. Ralf Hinze. Efficient monadic-style backtracking. Technical Report IAI-TR-96-9, Institut fur Informatik III, Universitat Bonn, October 1996.
16. John Hughes. The design of a pretty-printing library. In J. Jeuring and E. Meijer, editors, Advanced Functional Programming, volume 925 of Lecture Notes in Computer Science, pages 53-93. Springer-Verlag, 1995.
17. R. John Muir Hughes. A novel representation of lists and its application to the function "reverse". Information Processing Letters, 22(3): 141-144, March 1986.
18. Graham Hutton and Erik Meijer. Functional Pearl: Monadic parsing in Haskell. Journal of Functional Programming, 8(4), July 1998.
19. Information technology-Programming languages-Prolog-Part 1: General core. ISO/IEC JTC 1/SC22/WG17, June 1995.
20. Mark P. Jones. A system of constructor classes: overloading and implicit higherorder polymorphism. Journal of Functional Programming, 5(1): 1-35, January 1995.
21. Mark P. Jones. First-class polymorphism with type inference. In Conference Record of POPL '91: The 24th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 483-496, Paris, France, 15-17 January 1997.
22. Mark P. Jones and Luc Duponcheel. Composing monads. Technical Report YALEU/DCS/RR-1004, Department of Computer Science, Yale University, December 1993.
23. David J. King and Philip Wadler. Combining monads. In J. Launchbury and P.M. Sansom, editors, Proceedings of the 1992 Glasgow Workshop on Functional Programming, Ayr, Scotland, Workshops in Computing, pages 134-143. Springer-Verlag, July 1993.
24. Konstantin Laufer and Martin Odersky. An extension of ML with first-class abstract types. In Proceedings of the 1992 ACM Workshop on ML and its Applications, San Francisco, pages 78-91. Association for Computing Machinery, June 1992.
25. Sheng Liang, Paul Hudak, and Mark Jones. Monad transformers and modular interpreters. In Conference Record of POPL J94: 21st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, San Francisco, California, pages 333-343, January 1995.
26. John W. Lloyd. Foundations of Logic Programming. Springer-Verlag, 2nd edition, 1987.
27. E. Meijer, M. Fokkinga, and R. Paterson. Functional programming with bananas, lenses, envelopes and barbed wire. In 5th ACM Conference on Functional Programming Languages and Computer Architecture, FPCA '91, Cambridge, MA, USA, volume 523 of Lecture Notes in Computer Science, pages 124-144. Springer-Verlag, 1991.
28. Erik Meijer. Calculating Compilers. PhD thesis, Nijmegen University, 1992.
29. Chris Mellish and Steve Hardy. Integrating Prolog into the Poplog environment. In J.A. Campbell, editor, Implementations of Prolog, pages 533-535. Ellis Horwood Limited, 1984.
30. C.S. Mellish and W.F. Clocksin. Programming in Prolog. Springer-Verlag, Berlin, fourth edition edition, 1995.
31. Robin Milner, Mads Tofte, and Robert Harper. The Definition of Standard ML. The MIT Press, 1990.
32. Eugenio Moggi. An abstract view of programming languages. Technical Report ECS-LFCS-90-113, Department of Computer Science, Edinburgh University, 1990.
33. Eugenio Moggi. Notions of computation and monads. Information and Computation, 93(l):55-92, 1991.
34. Simon Peyton Jones, Mark Jones, and Erik Meijer. Type classes: Exploring the design space. In Proceedings of the Haskell Workshop, 1997.
35. Simon L Peyton Jones, Cordy Hall, Kevin Hammond, Will Partain, and Phil Wadler. The Glasgow Haskell compiler: a technical overview. In Proceedings of the UK Joint Framework for Information Technology (JFIT) Technical Conference, Keele, 1993.
36. Simon L. Peyton Jones and Philip Wadler. Imperative functional programming. In Proceedings of the 20th Annual ACM Symposium on Principles of Programming Languages, Charleston, South Carolina, pages 71-84, Charleston, South Carolina, January 1993.
37. Simon Peyton Jones [editor], John Hughes [editor], Lennart Augustsson, Dave Barton, Brian Boutel, Warren Burton, Simon Eraser, Joseph Fasel, Kevin Hammond, Ralf Hinze, Paul Hudak, Thomas Johnsson, Mark Jones, John Launchbury, Erik Meijer, John Peterson, Alastair Reid, Colin Runciman, and Philip Wadler. Haskell 98-A non-strict, purely functional language. Available from http://www.haskell.org/definition/, February 1999.
38. Didier Remy. Programming objects with ML-ART: An extension to ML with abstract and record types. In Masami Hagiya and John C. Mitchell, editors, International Symposium on Theoretical Aspects of Computer Software, pages 321-346, Sendai, Japan, April 1994. Springer-Verlag.
39. Niklas Rojemo. Efficient parsing combinators. unpublished, May 1995.
40. Tim Sheard and Leonidas Fegaras. A fold for all seasons. In Proceedings 6th ACM SIGPLAN/SIGARCH International Conference on Functional Programming Languages and Computer Architecture, FPCA'93, Copenhagen, Denmark, pages 233-242. ACM-Press, June 1993.
41. Zoltan Somogyi, Fergus Henderson, and Thomas Conway. Mercury: an efficient purely declarative logic programming language. In Proceedings of the Australian Computer Science Conference, pages 499-512, Glenelg, Australia, February 1995.
42. Leon Sterling and Ehud Shapiro. The Art of Prolog: Advanced Programming Techniques. The MIT Press, 1986.
43. Philip Wadler. Comprehending monads. In Proceedings of the 1990 ACM Conference on LISP and Functional Programming, Nice, pages 61-78. ACM-Press, June 1990.
44. Philip Wadler. The essence of functional programming. In Proceedings of the 19th Annual ACM Symposium on Principles of Programming Languages, Sante Fe, New Mexico, pages 1-14, January 1992.
45. Philip Wadler. How to declare an imperative (invited paper). In John Lloyd, editor, ILPS'95: International Logic Programming Symposium. MIT Press, December 1995.
46. Philip Wadler. Monads for functional programming. In J. Jeuring and E. Meijer, editors, Advanced Functional Programming, Proceedings of the Bdstad Spring School, number 925 in Lecture Notes in Computer Science. Springer-Verlag, May 1995.