Purely Functional Lazy Non-deterministic Programming

ACM SIGPLAN Notices

Volumn 44, Issue 9, 2009, Pages 11-22

  Fischer, Sebastian ^a   Kiselyov, Oleg ^b   Shan, Chung Chieh ^c  

^a UNIVERSITY OF KIEL   (Germany)

^b FNMOC   (United States)

^c RUTGERS UNIVERSITY   (United States)

Author keywords

Call time choice; Continuations; Monads; Side effects

Indexed keywords

LOGIC PROGRAMMING;

CALL-TIME CHOICE; CONTINUATIONS; DETERMINISTIC PROGRAMMING; FUNCTIONAL LOGIC PROGRAMMING; HIGH-QUALITY IMPLEMENTATION; MONADS; NONDETERMINISTIC PROGRAMS; SIDE EFFECT;

FUNCTIONAL PROGRAMMING;

EID: 70350437963     PISSN: 15232867     EISSN: None     Source Type: Journal    
DOI: 10.1145/1631687.1596556     Document Type: Conference Paper

References (45)

1. Acosta-Gómez, Alfonso. 2007. Hardware synthesis in ForSyDe. Master's thesis, Dept. of Microelectronics and Information Technology, Royal Institute of Technology, Stockholm, Sweden.
2. Albert, Elvira, Michael Hanus, Frank Huch, Javier Oliver, and German Vidal. 2005. Operational semantics for declarative multi-paradigm languages. Journal of Symbolic Computation 40(1):795-829.
3. Antoy, Sergio, and Michael Hanus. 2002. Functional logic design patterns. In FLOPS, 67-87.
4. 2006. Overlapping rules and logic variables in functional logic programs. In ICLP, 87-101.
5. Ariola, Zena M., and Matthias Felleisen. 1997. The call-by-need lambda calculus. JFP 7(3):265-301. (Pubitemid 127577460)
6. Ariola, Zena M., Matthias Felleisen, John Maraist, Martin Odersky, and Philip Wadler. 1995. The call-by-need lambda calculus. In POPL, 233-246.
7. Bird, Richard, Geraint Jones, and Oege de Moor. 1997. More haste, less speed: Lazy versus eager evaluation. JFP 7(5):541-547. (Pubitemid 127532776)
8. Bjesse, Per, Koen Claessen, Mary Sheeran, and Satnam Singh. 1998. Lava: Hardware design in Haskell. In ICFP, 174-184.
9. Braßel, Bernd, and Frank Huch. 2009. The Kiel Curry System KiCS. In WLP 2007, 195-205.
10. Christiansen, Jan, and Sebastian Fischer. 2008. EasyCheck - test data for free. In FLOPS, 322-336.
11. Claessen, Koen and John Hughes. 2000. QuickCheck: A lightweight tool for random testing of Haskell programs. In ICFP, 268-279.
12. Escardó, Martín H. 2007. Infinite sets that admit fast exhaustive search. In LICS, 443-452.
13. Felleisen, Matthias. 1985. Transliterating Prolog into Scheme. Tech. Rep. 182, Computer Science Dept., Indiana University.
14. Filinski, Andrzej. 1999. Representing layered monads. In POPL, 175-188.
15. Fischer, Sebastian, and Herbert Kuchen. 2007. Systematic generation of glass-box test cases for functional logic programs. In PPDP, 63-74.
16. González-Moreno, Juan Carlos, Maria Teresa, Hortalá- González, Francisco Javier, López-Fraguas, and Mario, Rodríguez-Artalejo. 1999. An approach to declarative programming based on a rewriting logic. Journal of Logic Programming 40(1):47-87.
17. Goodman, Noah, Vikash K. Mansinghka, Daniel Roy, Keith Bonawitz, and Joshua B. Tenenbaum. 2008. Church: A language for generative models. In UAI, 220-229.
18. Haynes, Christopher T. 1987. Logic continuations. Journal of Logic Programming 4(2):157-176.
19. Hinze, Ralf. 2000. Deriving backtracking monad transformers (functional pearl). In ICFP, 186-197.
20. Hudak, Paul. 1996. Building domain-specific embedded languages. ACM Computing Surveys 28(4es):196.
21. Hughes, John. 1989. Why functional programming matters. The Computer Journal 32(2):98-107.
22. Kiselyov, Oleg, and Chung-chieh Shan. 2009. Embedded probabilistic programming. In Working conf. on domain specific lang.
23. Kiselyov, Oleg, Chung-chieh Shan, Daniel P. Friedman, and Amr Sabry. 2005. Backtracking, interleaving, and terminating monad transformers (functional pearl). In ICFP, 192-203.
24. Koller, Daphne, David McAllester, and Avi Pfeffer. 1997. Effective Bayesian inference for stochastic programs. In AAAI, 740-747.
25. Lämmel, Ralf, and Simon L. Peyton Jones. 2003. Scrap your boilerplate: A practical design pattern for generic programming. In TLDI, 26-37.
26. Launchbury, John. 1993. A natural semantics for lazy evaluation. In POPL, 144-154.
27. Lin, Chuan-kai. 2006. Programming monads operationally with Unimo. In ICFP, 274-285.
28. López-Fraguas, Francisco Javier, Juan Rodríguez- Hortalá, and Jaime Sánchez-Hernández. 2007. A simple rewrite notion for call-time choice semantics. In PPDP, 197-208.
29. 2008. Rewriting and call-time choice: The HO case. In FLOPS, 147-162.
30. Maraist, John, Martin Odersky, and Philip Wadler. 1998. The callby- need lambda calculus. JFP 8(3):275-317.
31. McCarthy, John. 1963. A basis for a mathematical theory of computation. In Computer programming and formal systems, 33-70. North-Holland.
32. Michie, Donald. 1968. "Memo" functions and machine learning. Nature 218:19-22.
33. MonadPlus. 2008. MonadPlus. http://www.haskell.org/haskellwiki/MonadPlus.
34. Morrisett, J. Gregory. 1993. Refining first-class stores. In Proceedings of the workshop on state in programming languages.
35. Naylor, Matthew, Emil Axelsson, and Colin Runciman. 2007. A functional-logic library for Wired. In Haskell workshop, 37-48.
36. Nicollet, Victor, et al. 2009. Lazy and threads. http://caml.inria.fr/ pub/ml-archives/caml-list/2009/02/9fc4e4a897ce7a356674660c8cfa5ac0.fr.html.
37. Nordin, Thomas, and Andrew Tolmach. 2001. Modular lazy search for constraint satisfaction problems. JFP 11(5):557-587. (Pubitemid 33684767)
38. Rabin, Michael O., and Dana Scott. 1959. Finite automata and their decision problems. IBM Journal of Research and Development 3:114-125.
39. Runciman, Colin, Matthew Naylor, and Fredrik Lindblad. 2008. SmallCheck and Lazy SmallCheck: Automatic exhaustive testing for small values. In Haskell symposium, 37-48.
40. Seaman, Jill M. 1993. An operational semantics of lazy evaluation for analysis. Ph.D. thesis, Pennsylvania State University.
41. Spivey, J. Michael. 2000. Combinators for breadth-first search. JFP 10(4):397-408.
42. Tolmach, Andrew, and Sergio Antoy. 2003. A monadic semantics for core Curry. In WFLP, 33-46. Valencia, Spain.
43. Tolmach, Andrew, Sergio Antoy, and Marius Nita. 2004. Implementing functional logic languages using multiple threads and stores. In ICFP, 90-102.
44. de Vries, Edsko. 2009. Just how unsafe is unsafe. http://www.haskell.org/ pipermail/haskell-cafe/2009-February/055201.html.
45. Wadler, Philip L. 1985. How to replace failure by a list of successes: A method for exception handling, backtracking, and pattern matching in lazy functional languages. In FPCA, 113-128.