Alpha-structural recursion and induction

Lecture Notes in Computer Science

Volumn 3603, Issue , 2005, Pages 17-34

  Pitts, Andrew M ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LOGIC;

ABSTRACT SYNTAX TREES; ALPHA-STRUCTURAL RECURSION; FORMALIZATION; SYNTAX;

THEOREM PROVING;

EID: 26844491698     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11541868_2     Document Type: Conference Paper

References (23)

1. H. P. Barendregt. The Lambda Calculus: Its Syntax and Semantics. North-Holland, revised edition, 1984.
2. J. Cheney. Nominal Logic Programming. PhD thesis, Cornell University, August 2004.
3. A. Church. A formulation of the simple theory of types. Journal of Symbolic Logic, 5:56-68, 1940.
4. N. 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:381-392, 1972.
5. M. P. Fiore, G. D. Plotkin, and D. Turi. Abstract syntax and variable binding. In Proc. LICS'99, pages 193-202. IEEE Computer Society Press, 1999.
6. M. J. Gabbay. A Theory of Inductive Definitions with α-Equivalence: Semantics, Implementation, Programming Language. PhD thesis, University of Cambridge, 2000.
7. M. J. Gabbay. FM-HOL, a higher-order theory of names. In F. Kamareddine, editor, Workshop on Thirty Five years of Automath, Informal Proceedings. Heriot-Watt University, Edinburgh, Scotland, April 2002.
8. M. J. Gabbay and A. M. Pitts. A new approach to abstract syntax with variable binding. Formal Aspects of Computing, 13:341-363, 2002.
9. A. D. Gordon and T. Melham. Five axioms of alpha-conversion. In Proc. TPHOLS'96, volume 1125 of Lecture Notes in Computer Science, pages 173-191. Springer-Verlag, 1996.
10. T. G. Griffin. Notational definition - a formal account. In Proc. LICS'88, pages 372-383. IEEE Computer Society Press, 1988.
11. C. A. Gunter. Semantics of Programming Languages: Structures and Techniques. MIT Press, 1992.
12. F. Honsell, M. Miculan, and I. Scagnetto. An axiomatic approach to metareasoning on nominal algebras in HOAS. In Proc. ICALP 2001, volume 2076 of Lecture Notes in Computer Science, pages 963-978. Springer-Verlag, 2001.
13. J. Lambek and P. J. Scott. Introduction to Higher Order Categorical Logic. Cambridge University Press, 1986.
14. M. Norrish. Recursive function definition for types with binders. In Proc. TPHOLS 2004, volume 3223 of Lecture Notes in Computer Science, pages 241-256. Springer-Verlag, 2004.
15. F. Pfenning and C. Elliott. Higher-order abstract syntax. In Proc. PLDI'88, pages 199-208. ACM Press, 1988.
16. A. M. Pitts. Nominal logic, a first order theory of names and binding. Information and Computation, 186:165-193, 2003.
17. G. D. Plotkin. An illative theory of relations. In R. Cooper, Mukai, and J. Perry, editors, Situation Theory and its Applications, Volume 1, volume 22 of CSLI Lecture Notes, pages 133-146. Stanford University, 1990.
18. G. D. Plotkin. A structural approach to operational semantics. Journal of Logic and Algebraic Programming, 60-61:17-139, 2004.
19. D. Sangiorgi and D. Walker. The π-calculus: a Theory of Mobile Processes. Cambridge University Press, 2001.
20. M. R. Shinwell and A. M. Pitts. On a monadic semantics for freshness. Theoretical Computer Science, 2005. To appear.
21. A. Stoughton. Substitution revisited. Theoretical Computer Science, 59:317-325, 1988.
22. C. Urban, A. M. Pitts, and M. J. Gabbay. Nominal unification. Theoretical Computer Science, 323:473-497, 2004.
23. C. Urban and C. Tasson. Nominal techniques in Isabelle/HOL. In Proc. CADE-20, Lecture Notes in Computer Science, Springer-Verlag, 2005.