Formalized metatheory with terms represented by an indexed family of types

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

Volumn 3839 LNCS, Issue , 2006, Pages 1-16

  Adams, Robin ^a  

^a UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER OPERATING SYSTEMS; COMPUTER SCIENCE; THEOREM PROVING;

BINDING CONSTRUCTORS; FORMALIZATION; METATHEORY; TYPING SYSTEM;

INFORMATION THEORY;

EID: 33745177743     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11617990_1     Document Type: Conference Paper

References (14)

1. Bellegarde, F., Hook, J.: Subsitution: A formal methods case study using monads and transformations. Sci. Comput. Program. 23 (1994) 287-311
2. Altenkirch, T., Reus, B.: Monadic presentations of lambda terms using generalized inductive types. In: CSL '99. Volume 1683 of LNCS., Springer-Verlag (1999) 453-468
3. Bird, R.S., Paterson, R.: de Bruljn notation as a nested datatype. J. Functional Programming 9 (1999) 77-91
4. Barendregt, H.: Lambda calculi with types. In Abramsky, S., Gabbay, D.M., Maibaum, T.S.E., eds.: Handbook of Logic in Computer Science. Volume II. Oxford University Press (1992)
5. van Benthem Jutting, L.S.: Typing in pure type systems. Information and Computation 105 (1993) 30-41
6. McKlnna, J., Pollack, R.: Some lambda calculus and type theory formalized. J. Autom. Reasoning 23 (1999) 373-409
7. Barras, B.: Auto-validation d'un sysème de preuves avec familles inductives. PhD thesis, Université Paris 7 (1999)
8. Letouzey, P.: Vectors. Message to Coq-Club mailing list (2004) http://pauillac.inria.fr/pipermail/coq-club/2004/001265.html.
9. Adams, R.: A formalization of the theory of PTSs in Coq. Available online at http://www.cs.rhul.ac.uk/~robin/coqPTS/docu.dvi (2005)
10. Adams, R.: Pure type systems with judgemental equality. (Accepted for publication in the Journal of Functional Programming)
11. Barras, B.: A formalization of the calculus of constructions. (Web page) http://coq.inria.fr/contribs/coq-in-coq.html
12. Pfenning, F., Elliot, C.: Higher-order abstract syntax. In: PLDI '88: Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation, New York, NY, USA, ACM Press (1988) 199-208
13. Gabbay, M.J., Pitts, A.M.: A new approach to abstract syntax with variable binding. Formal Aspects of Computing 13 (2002) 341-363
14. Stehr, M.O.: CINNI: A generic calculus of explicit substitutions and its application to lambda-, sigma- and pi-calculi, In: Third International Workshop on Rewriting Logic and its Applications (WRLA'2000), Kanazawa, Japan, September 18 - 20, 2000. Volume 36 of Electronic Notes in Theoretical Computer Science., Elsevier (2000)