Inductive reasoning about effectful data types

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

Volumn , Issue , 2007, Pages 97-110

  Filinski, Andrzej ^a   Støvring, Kristian ^b  

^a UNIVERSITY OF COPENHAGEN   (Denmark)

^b AARHUS UNIVERSITY   (Denmark)

Author keywords

Abstract effects; Backtracking; Equational reasoning; Logical relations; Monads; Recursive types; Streams

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; DATABASE SYSTEMS; MATHEMATICAL MODELS; SEARCH ENGINES; THEOREM PROVING; TREES (MATHEMATICS);

ABSTRACT EFFECTS; BACKTRACKING; EQUATIONAL REASONING; LOGICAL RELATIONS; MONADS; RECURSIVE TYPES;

CASE BASED REASONING;

EID: 38849202373     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1291151.1291168     Document Type: Conference Paper

References (17)

1. Roy L. Croie and Andrew M. Pitts. New foundations for flxpoint computations: FIX-hyperdoctrines and the FIX-logic. Information and Computation, 98:171-210, 1992.
2. Olivier Danvy and Kevin Millikin. Refunctionalization at work. BRICS Research Report RS-07-7, Department of Computer Science, University of Aarhus, 2007.
3. Olivier Danvy, Bernd Grobauer, and Morten Rhiger. A unifying approach to goal-directed evaluation. New Generation Computing, 20(1):53-73, 2002. ISSN 0288-3635.
4. Andrzej Filinski. Representing layered monads. In Proceedings of the 26th ACM Symposium on Principles of Programming Languages, pages 175-188, San Antonio, Texas, January 1999. ACM Press.
5. Andrzej Filinski. On the relations between monadic semantics. Theoretical Computer Science, 375(1):41-75, 2007.
6. Marcelo Fiore and Gordon D. Plotkin. An axiomatisation of computationally adequate domain theoretic models of FPC. In Proceedings of the Ninth Symposium on Logic in Computer Science, pages 92-102, Paris, France, 1994.
7. Ralf Hinze. Deriving backtracking monad transformers. In ICFP '00: Proceedings of the 5th International Conference on Functional programming, pages 186-197. ACM Press, 2000.
8. Martin Hofmann. Non strictly positive datatypes for breadth first search. TYPES Forum posting, 1993. Available from http://www.seas.upenn.edu/~sweirich/ types/archive/1993/msg00027.html.
9. John Hughes. The design of a pretty-printing library. In Advanced Functional Programming, First International Spring School, volume 925 of LNCS, pages 53-96, 1995.
10. Oleg Kiselyov, Chung-chieh Shan, Daniel P. Friedman, and Amr Sabry. Backtracking, interleaving, and terminating monad transformers. In ICFP '05: Proceedings of the 10th International conference on Functional programming, pages 192-203. ACM Press, 2005.
11. Daniel J. Lehmann and Michael B. Smyth. Algebraic specification of data types: A synthetic approach. Mathematical Systems Theory, 14:97-139, 1981.
12. Eugenio Moggi. Notions of computation and monads. Information and Computation, 93(1):55-92, July 1991.
13. Andrew M. Pitts. Relational properties of domains. Information and Computation, 127:66-90, 1996.
14. Chris Reade. Elements of Functional Programming. Addison Wesley, 1989.
15. John C. Reynolds. On the relation between direct and continuation semantics. In 2nd Colloquium on Automata, Languages and Programming, volume 14 of LNCS, pages 141-156, Saarbrücken, Germany, July 1974.
16. Michael Spivey. Algebras for combinatorial search. In Workshop on Mathematically Structured Functional Programming, Kuressaare, Estonia, July 2006.
17. Mitchell Wand and Dale Vaillancourt. Relating models of backtracking. In ICFP '04: Proceedings of the 9th International conference on Functional programming, pages 54-65. ACM Press, 2004.