A dependent type theory with names and binding

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

Volumn 3210, Issue , 2004, Pages 235-249

  Schöpp, Ulrich ^a   Stark, Ian ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

BINS; SET THEORY;

ABSTRACT SYNTAX; AXIOMATI-SATION; CATEGORICAL STRUCTURE; DEPENDENT TYPE THEORY; GENERALISATION; MONOIDAL STRUCTURE; NAME-BINDING; SCHANUEL TOPOS;

FORMAL LANGUAGES;

EID: 33847624563     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30124-0_20     Document Type: Article

References (23)

1. L. Cardelli, P. Gardner, and G. Ghelli. Manipulating trees with hidden labels. In Proceedings of FOSSACS'03, volume 2620 of LNCS. Springer, 2003.
2. L. Cardelli and A. Gordon. Logical properties of name restriction. In Proceedings of TLCA '01, volume 2044 of LNCS. Springer, 2001.
3. J. Despeyroux, A. Felty, and A. Hirschowitz. Higher-order abstract syntax in Coq. In Proceedings of TLCA'95, 1995.
4. M. Fiore, G. Plotkin, and D. Tun. Abstract syntax and variable binding. In Proceedings of LICS99, 1999.
5. M. Fiore and D. Turi. Semantics of name and value passing. In Proceedings of LICSOl, 2001.
6. M. Gabbay. FM-HOL, a higher-order theory of names. In Workshop on Thirty Five years of Automath, 2002.
7. M. J. Gabbay and A. M. Pitts. A new approach to abstract syntax with variable binding. Formal Aspects of Computing, 13:341-363, 2002.
8. M. Hofmann. On the interpretation of type theory in locally cartesian closed categories. In Proceedings of CSL94, volume 933 of LNCS. Springer, 1994.
9. M. Hofmann. Semantical analysis of higher-order abstract syntax. In Proceedings of LICS99, 1999.
10. M. Hofmann. Safe recursion with higher types and BCK-algebra. Annals of Pure and Applied Logic, 104(1-3):113-166, 2000.
11. F. Honsell, M. Miculan, and I. Scagnetto. An axiomatic approach to metareasoning about nominal algebras in HOAS. In Proceedings of ICALP01, 2001.
12. B. Jacobs. Categorical Logic and Type Theory. Elsevier Science, 1999.
13. P.T. Johnstone. Sketches of an Elephant: A Topos Theory Compendium. Oxford University Press, 2002.
14. P. Lietz. A fibrational theory of geometric morphisms. Master's thesis, TU Darmstadt, May 1998.
15. S. MacLane and I. Moerdijk. Sheaves in Geometry and Logic: A First Introduction to Topos Theory. Springer-Verlag, 1992.
16. M. Menni. About-quantifiers. Applied Categorical Structures, 11(5):421-445, 2003.
17. P. O'Hearn. On bunched typing. Journal of Functional Programming, 13(4):747-796, 2003.
18. A. M. Pitts. Nominal logic, a first order theory of names and binding. Information and Computation, 186:165-193, 2003.
19. A. M. Pitts and M. J. Gabbay. A metalanguage for programming with bound names modulo renaming. In Proceedings of MPC2000, volume 1837 of LNCS. Springer, 2000.
20. D. Pym. The Semantics and Proof Theory of the Logic of Bunched Implications. Kluwer Academic Publishers, 1999.
21. R.A.G. Seely. Locally cartesian closed categories and type theory. In Math. Proc. Cambridge Philos. Soc., volume 95, pages 33-48, 1984.
22. P. Taylor. Practical Foundations of Mathematics. Cambridge University Press, 1999.
23. C. Urban, A. M. Pitts, and M. J. Gabbay. Nominal unification. In Proceedings of CSL'03, volume 2803 of LNCS. Springer, 2003.