Recursive Function Definition for Types with Binders

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3223, Issue , 2004, Pages 241-256

  Norrish, Michael ^a  

^a AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

BINDERS; BINS; CALCULATIONS; COMPUTATIONAL MECHANICS; DIFFERENTIATION (CALCULUS); FORMAL LOGIC; FUNCTIONS;

ALPHA-EQUIVALENCE; BOUND VARIABLES; FRESH NAMES; FUNCTION DEFINITIONS; LAMBDA CALCULUS; RECURSIONS;

RECURSIVE FUNCTIONS;

EID: 35048868796     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30142-4_18     Document Type: Article

References (9)

1. Simon J. Ambler, Roy L. Crole, and Alberto Momigliano. A definitional approach to primitive recursion over higher order abstract syntax. In Honsell et al. [6]. Available at http://doi.acm.org/10.1145/976571.976572.
2. H. P. Barendregt. The Lambda Calculus: its Syntax and Semantics, volume 103 of Studies in Logic and the Foundations of Mathematics. Elsevier, Amsterdam, revised edition, 1984.
3. M. J. Gabbay. A Theory of Inductive Definitions with Alpha-Equivalence. PhD thesis, University of Cambridge, 2001.
4. M. J. Gabbay and A. M. Pitts. A new approach to abstract syntax involving binders. In 14th Annual Symposium on Logic in Computer Science, pages 214-224. IEEE Computer Society Press, Washington, 1999.
5. A. D. Gordon and T. Melham. Five axioms of alpha conversion. In J. von Wright, J. Grundy, and J. Harrison, editors, Theorem Proving in Higher Order Logics: 9th International Conference, TPHOLs'96, volume 1125 of Lecture Notes in Computer Science, pages 173-190. Springer-Verlag, 1996.
6. Furio Honsell, Marino Miculan, and Alberto Momigliano, editors. Merlin 2003, Proceedings of the Second ACM SIGPLAN Workshop on Mechanized Reasoning about Languages with Variable Binding. ACM Digital Library, 2003.
7. Michael Norrish. Mechanising Hankin and Barendregt using the Gordon-Melham axioms. In Honsell et al. [6]. Available at http://doi.acm.org/10. 1145/976571.976577.
8. Carsten Schürmann, Joëlle Despeyroux, and Frank Pfenning. Primitive recursion for higherorder abstract syntax. Theoretical Computer Science, 266(1-2): 1-57, September 2001.
9. Geoffrey Washburn and Stephanie Weirich. Boxes go bananas: Encoding higher-order abstract syntax with parametric polymophism. In ICFP'03: Proceedings of the Eighth A CM SIGPLAN International Conference on Functional Programming, pages 249-262. ACM Press, 2003.