A type-theoretic foundation for programming with higher-order abstract syntax and first-class substitutions

ACM SIGPLAN Notices

Volumn 43, Issue 1, 2008, Pages 371-382

  Pientka, Brigitte ^a  

^a MCGILL UNIVERSITY   (Canada)

Author keywords

Logical frameworks; Type theory

Indexed keywords

BINDERS; COMPUTATION THEORY; PATTERN MATCHING; SYNTACTICS;

BI-DIRECTIONAL; COMPUTATION LANGUAGES; HIGHER-ORDER; HIGHER-ORDER ABSTRACT SYNTAX; LOGICAL FRAMEWORKS; NOMINAL SYSTEM; TYPE SYSTEMS; TYPE THEORY;

FUNCTIONAL PROGRAMMING;

EID: 67650106117     PISSN: 15232867     EISSN: None     Source Type: Journal    
DOI: 10.1145/1328897.1328483     Document Type: Article

References (26)

1. Martín Abadi, Luca Cardelli, Pierre-Louis Curien, and Jean-Jacques Lèvy. Explicit substitutions. In Conference Record of the Seventeenth Annual ACM Symposium on Principles of Programming Languages, San Francisco, California, pages 31-46. ACM, 1990.
2. Joëlle Despeyroux, Frank Pfenning, and Carsten Schürmann. Primitive recursion for higher-order abstract syntax. In R. Hindley, editor, Proceedings of the Third International Conference on Typed Lambda Calculus and Applications (TLCA'97), pages 147-163, Nancy, France, Lecture Notes in Computer Science (LNCS) 1210, Springer-Verlag, 1997.
3. 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, IEEE Computer Society Press, 1999.
4. Louis-Julien Guillemette and Stefan Monnier. Statically verified type-preserving code transformations in Haskell. In Programming Languages meets Program Verification (PLPV), Seattle, USA, Electronic Notes in Theoretical Computer Science (ENTCS). Elsevier, 2006.
5. Robert Harper, Furio Honsell, and Gordon Plotkin. A framework for defining logics. Journal of the Association for Computing Machinery, 40(1): 143-184, January 1993.
6. Masatomo Hashimoto and Atsushi Ohori. A typed context calculus. Theoretical Computer Science, 266(1-2):249-272, 2001.
7. Ik-Soon Kim, Kwangkeun Yi, and Cristiano Calcagno. A polymorphic modal type system for Lisp-like multi-staged languages. In 33rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Lan-guages(POPL '06), pages 257-268, New York, NY, USA, ACM Press, 2006.
8. Ian A. Mason. Computing with contexts. Higher-Order and Symbolic Computation, 12(2):171-201, 1999.
9. Andrew McCreight and Carsten Schurmann. A meta-linear logical framework. In Carsten Schürmann, editor, 4th International Workshop on Logical Frameworks and Meta-Languages (LFM'04), 2004.
10. Dale Miller. Unification of simply typed lambda-terms as logic programming. In Eighth International Logic Programming Conference, pages 255-269, Paris, France, MIT Press, 1991.
11. Dale Miller. An extension to ML to handle bound variables in data structures. In G. Huet and G. Plotkin, editors, Proceedings of the First Workshop on Logical Frameworks, pages 323-335, 1990.
12. Aleksandar Nanevski, Frank Pfenning, and Brigitte Pientka. A contextual modal type theory. ACM Transactions on Computational Logic (accepted, to appear in 2008), page 56 pages, 2006.
13. Shin-Ya Nishizaki. A polymorphic environment calculus and its type-inference algorithm. Higher Order Symbol. Comput., 13(3):239-278, 2000.
14. Frank Pfenning and Carsten Schürmann. System description: Twelf - a meta-logical framework for deductive systems. In H. Ganzinger, editor, Proceedings of the 16th International Conference on Automated Deduction (CADE-16), pages 202-206, Trento, Italy, Lecture Notes in Artificial Intelligence (LNAI) 1632, Springer-Verlag, 1999.
15. Brigitte Pientka. Tabled higher-order logic programming. PhD thesis, Department of Computer Sciences, Carnegie Mellon University, 2003. CMU-CS-03-185.
16. Brigitte Pientka and Frank Pfennning. Optimizing higher-order pattern unification. In F. Baader, editor, 19th International Conference on Automated Deduction, pages 473-487, Miami, USA, Lecture Notes in Artificial Intelligence (LNAI) 2741, Springer-Verlag, 2003.
17. Adam Poswolsky and Carsten Schurmann. Programming with higher-order encodings and dependent types. Technical Report YALEU/D-CS/TR1375, Department of Computer Science, Yale University, July 2007.
18. François Pottier. Static name control for FreshML. In Twenty-Second Annual IEEE Symposium on Logic in Computer Science (LICS'07), pages 356-365, Wroclaw, Poland, IEEE Computer Society, 2007.
19. Masahiko Sato, Takafumi Sakurai, and Rod Burstall. Explicit environments. Fundamenta Informaticae, 45(1-2):79-115, 2001.
20. Masahiko Sato, Takafumi Sakurai, and Yukiyoshi Kameyama. A simply typed context calculus with first-class environments. Journal of Functional and Logic Programming, 2002(4), March 2002.
21. Carsten Schürmann. Automating the meta theory of deductive systems. PhD thesis, Department of Computer Sciences, Carnegie Mellon University, Available as Technical Report CMU-CS-00-146, 2000.
22. Carsten Schürmann and Frank Pfenning. A coverage checking algorithm for LF. In D. Basin and B. Wolff, editors, Proceedings of the 16th International Conference on Theorem Proving in Higher Order Logics (TPHOLs 2003), pages 120-135, Rome, Italy, Lecture Notes in Computer Science (LNCS) 2758, Springer-Verlag, 2003.
23. Carsten Schurmann, Adam Poswolsky, and Jeffrey Sarnat. The λ-calculus. functional programming with higher-order encodings. In Pawel Urzy-czyn, editor, Proceedings of the 7th International Conference on Typed Lambda Calculi and Applications(TLCA'05), pages 339-353, Nara, Japan, Lecture Notes in Computer Science (LNCS) 3461, Springer, 2005.
24. Mark R. Shinwell, Andrew M. Pitts, and Murdoch J. Gabbay. Fresh ML: programming with binders made simple. In Eighth ACM SIGPLAN International Conference on Functional Programming (ICFP'03), pages 263-274, New York, NY, USA, 2003. ACM Press.
25. Geoff Washburn and Stephanie Weirich. Boxes go bananas: Encoding higher-order abstract syntax with parametric polymorphism. Journal of Functional Programming, 2007 (to appear).
26. Kevin Watkins, Iliano Cervesato, Frank Pfenning, and David Walker. A concurrent logical framework I: Judgments and properties. Technical Report CMU-CS-02-101, Department of Computer Science, Carnegie Mellon University, 2002.