An overview of Cαml

Electronic Notes in Theoretical Computer Science

Volumn 148, Issue 2, 2006, Pages 27-52

  Pottier, François ^a  

^a INRIA   (France)

Author keywords

conversion; Metaprogramming; Variable binding

Indexed keywords

Α-CONVERSION; METAPROGRAMMING; VARIABLE BINDING;

COMPUTER HARDWARE DESCRIPTION LANGUAGES; COMPUTER SCIENCE; COMPUTER SYSTEMS PROGRAMMING; DATA REDUCTION;

COMPUTER AIDED SOFTWARE ENGINEERING;

EID: 33644901546     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2005.11.039     Document Type: Conference Paper

References (36)

1. Brian E. Aydemir, Aaron Bohannon, Matthew Fairbairn, J. Nathan Foster, Benjamin C. Pierce, Peter Sewell, Dimitrios Vytiniotis, Geoffrey Washburn, Stephanie Weirich, and Steve Zdancewic Mechanized metatheory for the masses: The PoplMark challenge International Conference on Theorem Proving in Higher Order Logics (TPHOLs) Lecture Notes in Computer Science August 2005 Springer Verlag
2. Henk P. Barendregt Functional programming and lambda calculus J. Van Leeuwen Handbook of Theoretical Computer Science 1990 Elsevier Science 321 363
3. Richard Bird, and Ross Paterson de Bruijn notation as a nested datatype Journal of Functional Programming 9 1 January 1999 77 91
4. Robert Cartwright. Notes on object-oriented program design, January 2000
5. James Cheney. Scrap your nameplate. In ACM International Conference on Functional Programming (ICFP), September 2005
6. James Cheney, and Christian Urban αProlog: A logic programming language with names, binding and α-equivalence International Conference on Logic Programming (ICLP) Lecture Notes in Computer Science volume 3132 September 2004 Springer Verlag 269 283
7. Nicolaas G. de Bruijn Lambda-calculus notation with nameless dummies: a tool for automatic formula manipulation with application to the Church-Rosser theorem Indag. Math. 34 5 1972 381 392
8. Jacques Garrigue. Programming with polymorphic variants. In ACM Workshop on ML, September 1998
9. Ralf Hinze and Simon Peyton Jones. Derivable type classes. In Haskell workshop, 2000
10. Tom Hirschowitz, Xavier Leroy, and J.B. Wells Call-by-value mixin modules: Reduction semantics, side effects, types European Symposium on Programming (ESOP) Lecture Notes in Computer Science volume 2986 April 2004 Springer Verlag 64 78
11. Furio Honsell, Marino Miculan, and I. van Scagnetto An axiomatic approach to metareasoning on nominal algebras in HOAS International Colloquium on Automata, Languages and Programming Lecture Notes in Computer Science volume 2076 2001 Springer Verlag 963 978
12. Xavier Leroy, Damien Doligez, Jacques Garrigue, Didier Rémy, and Jérôme Vouillon The Objective Caml system July 2004
13. Ralf Lämmel and Simon Peyton Jones. Scrap your boilerplate with class: extensible generic functions. Submitted, April 2005
14. Conor McBride and James McKinna. I am not a number: I am a free variable. In Haskell workshop, September 2004
15. Dale Miller. An extension to ML to handle bound variables in data structures. In Logical Frameworks BRA Workshop, May 1990
16. Gopalan Nadathur and Xiaochu Qi. Explicit substitutions in the reduction of lambda terms. In International ACM Conference on Principles and Practice of Declarative Programming (PPDP), pages 195-206, August 2003
17. Chris Okasaki. Views for Standard ML. In ACM Workshop on ML, pages 14-23, September 1998
18. Chris Okasaki and Andy Gill. Fast mergeable integer maps. In ACM Workshop on ML, pages 77-86, September 1998
19. Emir Pašalić, Tim Sheard, and Walid Taha. DALI: An untyped, CBV functional language supporting first-order datatypes with binders (technical development). Technical Report 00-007, Oregon Graduate Institute, March 2000
20. Frank Pfenning and Conal Elliott. Higher-order abstract syntax. In ACM Conference on Programming Language Design and Implementation (PLDI), pages 199-208, June 1988
21. Benjamin C. Pierce Types and Programming Languages 2002 MIT Press
22. Andrew M. Pitts Nominal logic, A first order theory of names and binding Information and Computation 186 2003 165 193
23. Andrew M. Pitts Alpha-structural recursion and induction International Conference on Theorem Proving in Higher Order Logics (TPHOLs) Lecture Notes in Computer Science August 2005 Springer Verlag
24. Andrew M. Pitts, and Murdoch J. Gabbay A metalanguage for programming with bound names modulo renaming International Conference on Mathematics of Program Construction (MCP) Lecture Notes in Computer Science volume 1837 2000 Springer Verlag 230 255
25. Gordon Plotkin An illative theory of relations Situation Theory and its Applications CSLI Lecture Notes number 22 1990 Stanford University 133 146
26. François Pottier. Cαml, June 2005
27. Carsten Schürmann, Adam Poswolsky, and Jeffrey Sarnat. The nabla-calculus. functional programming with higher-order encodings. Unpublished, September 2005
28. Tim Sheard Accomplishments and research challenges in meta-programming International Workshop on Semantics, Applications, and Implementation of Program Generation (SAIG) Lecture Notes in Computer Science volume 2196 2001 Springer Verlag 2 44
29. Mark R. Shinwell. The Fresh Approach: functional programming with names and binders. PhD thesis, University of Cambridge, February 2005
30. Mark R. Shinwell. Fresh O'Caml: nominal abstract syntax for the masses. In ACM Workshop on ML, September 2005
31. Mark R. Shinwell and Andrew M. Pitts. Fresh Objective Caml user manual. Technical Report 621, University of Cambridge, February 2005
32. Mark R. Shinwell, Andrew M. Pitts, and Murdoch J. Gabbay. FreshML: Programming with binders made simple. In ACM International Conference on Functional Programming (ICFP), pages 263-274, August 2003
33. Carolyn Talcott A theory of binding structures and applications to rewriting Theoretical Computer Science 112 1 1993 99 143
34. Christian Urban, Andrew Pitts, and Murdoch Gabbay Nominal unification Theoretical Computer Science 323 2004 473 497
35. Christian Urban, and Christine Tasson Nominal techniques in Isabelle/HOL International Conference on Automated Deduction (CADE) Lecture Notes in Computer Science 2005 Springer Verlag
36. Stephanie Weirich. A typechecker that produces a typed term from an untyped source. Part of the Glasgow Haskell compiler's test suite, September 2004