The ▽-Calculus. Functional programming with higher-order encodings

Lecture Notes in Computer Science

Volumn 3461, Issue , 2005, Pages 339-353

  Schürmann, Carsten ^a   Poswolsky, Adam ^a   Sarnat, Jeffrey ^a  

^a Yale University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; COMPUTATIONAL METHODS; COMPUTER PROGRAMMING; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SCIENCE; RECURSIVE FUNCTIONS;

FUNCTIONAL PROGRAMMING; HIGHER-ORDER ENCODINGS; Λ-BINDERS; ▽-CALCULUS;

ENCODING (SYMBOLS);

EID: 24944465041     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11417170_25     Document Type: Conference Paper

References (12)

1. [Coq91] Thierry Coquand. An algorithm for testing conversion in type theory. In Gérard Huet and Gordon Plotkin, editors, Logical Frameworks, pages 255-279. Cambridge University Press, 1991.
2. [GP99] Murdoch Gabbay and Andrew Pitts. A new approach to abstract syntax involving binders. In G. Longo, editor, Proceedings of the 14th Annual Symposium on Logic in Computer Science (LICS'99), pages 214-224, Trento, Italy, July 1999. IEEE Computer Society Press.
3. [HMS01] Furio Honsell, Marino Miculan, and Ivan Scagnetto. π-calculus in (Co)inductive-type theory. Theoretical Computer Science, 253(2):239-285, 2001.
4. [Hof99] Martin Hofmann. Semantical analysis for higher-order abstract syntax. In G. Longo, editor, Proceedings of the 14th Annual Symposium on Logic in Computer Science (LICS'99), pages 204-213, Trento, Italy, July 1999. IEEE Computer Society Press.
5. [MAC03] Alberto Momigliano, Simon Ambler, and Roy Crole. A definitional approach to primitive recursion over higher order abstract syntax. In Alberto Momigliano and Marino Miculan, editors, Proceedings of the Merlin Workshop, Uppsala, Sweden, June 2003; ACM Press.
6. [Mil90] Dale Miller. An extension to ML to handle bound variables in data structures: Preliminary report. In Proceedings of the Logical Frameworks BRA Workshop, Nice, France, May 1990.
7. [PM93] Christine Paulin-Mohring. Inductive definitions in the system Coq: Rules and properties. In M. Bezem and J.F. Groote, editors, Proceedings of the International Conference on Typed Lambda Calculi and Applications, pages 328-345, Utrecht, The Netherlands, March 1993. Springer-Verlag LNCS 664.
8. [PS05] Adam Poswolsky and Carsten Schürmann. Elphin user's manual. Technical report, Yale University, 2005. To appear. See also http://www.cs.yale.edu/~delphin.
9. [Sch01] Garsten Schürmann. Recursion for higher-order encodings. In Laurent Fribourg, editor, Proceedings of the Conference on Computer Science Logic (CSL 2001), pages 585-599, Paris, France, August 2001. Springer Verlag LNCS 2142.
10. [SDP01] Garsten Schürmann, Joëlle Despeyroux, and Frank Pfenning. Primitive recursion for higher-order abstract syntax. Theoretical Computer Science, (266):1-57, 2001.
11. [SPS04] Carsten Schürmann, Adam Poswolsky, and Jeffrey Sarnat. The ▽-calculus. Functional programming with higher-order encodings. Technical Report YALEU/DCS/TR-1272, Yale University, October 2004.
12. [TS00] Walid Taha and Tim Sheard. MetaML: Multi-stage programming with explicit annotations. Theoretical Computer Science, 248(1-2), 2000.