Refinement types for logical frameworks and their interpretation as proof irrelevance

Logical Methods in Computer Science

Volumn 6, Issue 4, 2010, Pages 1-50

  Lovas, William ^a   Pfenning, Frank ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Logical frameworks; Proof irrelevance; Refinement types

Indexed keywords

FORMAL LANGUAGES;

CORRECTNESS PROOFS; DEPENDENT TYPES; EXPRESSIVE POWER; INTERSECTION TYPES; LOGICAL FRAMEWORKS; PROOF IRRELEVANCE; REFINEMENT TYPES; STRUCTURAL RULES;

FORMAL LOGIC;

EID: 79951884422     PISSN: None     EISSN: 18605974     Source Type: Journal    
DOI: 10.2168/LMCS-6(4:5)2010     Document Type: Article

References (34)

1. [AB04] Steven Awodey and Andrej Bauer. Propositions as [types]. Journal of Logic and Computation, 14(4):447-471, 2004.
2. [AC01] David Aspinall and Adriana B. Compagnoni. Subtyping dependent types. Theoretical Computer Science, 266(1-2):273-309, 2001.
3. [BTCGS91] Val Breazu-Tannen, Thierry Coquand, Carl A. Gunter, and Andre Scedrov. Inheritance as implicit coercion. Information and Computation, 93(1):172-221, July 1991.
4. [C+86] Robert L. Constable et al. Implementing Mathematics with the Nuprl Proof Development System. Prentice-Hall, Englewood Cliffs, New Jersey, 1986.
5. [CDG+07] H. Comon, M. Dauchet, R. Gilleron, C. Löding, F. Jacquemard, D. Lugiez, S. Tison, and M. Tommasi. Tree automata techniques and applications. Available on: http://www.grappa.univ-lille3.fr/tata, 2007. release October, 12th 2007.
6. [Cra03 Karl Crary. Toward a foundational typed assembly language. In G. Morrisett, editor, Proceedings of the 30th Annual Symposium on Principles of Programming Languages (POPL'03), pages 198-212, New Orleans, Louisiana, January 2003. ACM Press.
7. [Dav05] Rowan Davies. Practical Refinement-Type Checking. PhD thesis, Carnegie Mellon University, May 2005. Available as Technical Report CMU-CS-05-110.
8. [DP04] Joshua Dunfield and Frank Pfenning. Tridirectional typechecking. In Xavier Leroy, editor, ACM Symp. Principles of Programming Languages (POPL'04), pages 281-292, Venice, Italy, January 2004.
9. [Dun07] Joshua Dunfield. A Unified System of Type Refinements. PhD thesis, Carnegie Mellon University, August 2007. Available as Technical Report CMU-CS-07-129.
10. [DZ92] Philip W. Dart and Justin Zobel. A regular type language for logic programs. In Frank Pfenning, editor, Types in Logic Programming, pages 157-187. MIT Press, Cambridge, Massachusetts, 1992.
11. [FP91] Tim Freeman and Frank Pfenning. Refinement types for ML. In Proceedings of the SIGPLAN'91 Symposium on Language Design and Implementation, pages 268-277, Toronto, Ontario, June 1991. ACM Press.
12. [Fre94] Tim Freeman. Refinement Types for ML. PhD thesis, Carnegie Mellon University, March 1994. Available as Technical Report CMU-CS-94-110.
13. [HHP93] 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.
14. [HL07] Robert Harper and Daniel R. Licata. Mechanizing metatheory in a logical framework. Journal of Functional Programming, 17(4-5):613-673, July 2007.
15. [HP05] Robert Harper and Frank Pfenning. On equivalence and canonical forms in the LF type theory. Transactions on Computational Logic, 6:61-101, January 2005.
16. [LCH07] Daniel K. Lee, Karl Crary, and Robert Harper. Towards a mechanized metatheory of Standard ML. In Matthias Felleisen, editor, Proceedings of the 34th Annual Symposium on Principles of Programming Languages (POPL'07), pages 173-184, Nice, France, January 2007. ACM Press.
17. [LP08a] William Lovas and Frank Pfenning. A bidirectional refinement type system for LF. Electronic Notes in Theoretical Computer Science, 196:113-128, January 2008.
18. [LP08b] William Lovas and Frank Pfenning. A bidirectional refinement type system for LF. Technical Report CMU-CS-08-129, Department of Computer Science, Carnegie Mellon University, 2008.
19. [LP09] William Lovas and Frank Pfenning. Refinement types as proof irrelevance. In Pierre-Louis Curien, editor, Proceedings of 9th International Conference on Typed Lambda Calculi and Ap-plications (TLCA 2009), number 5608 in Lecture Notes in Computer Science, pages 157-171. Springer, 2009.
20. [LRDR07] Luigi Liquori and Simona Ronchi Della Rocca. Intersection-types à la Church. Information and Computation, 205(9):1371-1386, 2007.
21. [NPP07] Aleksandar Nanevski, Frank Pfenning, and Brigitte Pientka. Contextual modal type theory. Transactions on Computational Logic, 2007. To appear.
22. [Pfe93] Frank Pfenning. Refinement types for logical frameworks. In Herman Geuvers, editor, Informal Proceedings of the Workshop on Types for Proofs and Programs, pages 285-299, Nijmegen, The Netherlands, May 1993.
23. [Pfe00] Frank Pfenning. Structural cut elimination: I. intuitionistic and classical logic. Information and Computation, 157(1-2):84-141, 2000.
24. [Pfe01a] Frank Pfenning. Intensionality, extensionality, and proof irrelevance in modal type theory. In J. Halpern, editor, Proceedings of the 16th Annual Symposium on Logic in Computer Science (LICS'01), pages 221-230, Boston, Massachusetts, June 2001. IEEE Computer Society Press.
25. [Pfe01b] Frank Pfenning. Logical frameworks. In Alan Robinson and Andrei Voronkov, editors, Handbook of Automated Reasoning, chapter 17, pages 1063-1147. Elsevier Science and MIT Press, 2001.
26. [PS99] 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, July 1999. Springer-Verlag LNAI 1632.
27. [Rey89] John C. Reynolds. Even normal forms can be hard to type. Unpublished, marked Carnegie Mellon University, December 1, 1989.
28. [Rey91] John C. Reynolds. The coherence of languages with intersection types. In Takayasu Ito and Albert R. Meyer, editors, Theoretical Aspects of Computer Software, volume 526 of Lecture Notes in Computer Science, pages 675-700, Berlin, 1991. Springer-Verlag.
29. [Rey96] John C. Reynolds. Design of the programming language Forsythe. Report CMU-CS-96-146, Carnegie Mellon University, Pittsburgh, Pennsylvania, June 28, 1996.
30. [RP08] Jason Reed and Frank Pfenning. Proof irrelevance in a logical framework. Unpublished draft, July 2008.
31. [Sar09] Susmit Sarkar. A Dependently Typed Programming Language, with Applications to Foundational Certified Code Systems. PhD thesis, Carnegie Mellon University, May 2009. Available as Technical Report CMU-CS-09-128.
32. [Sch03] Carsten. Towards practical functional programming with logical frameworks. Unpublished, available at http://cs-www.cs.yale.edu/homes/carsten/delphin/, July 2003.
33. [SS88] Anne Salvesen and Jan M. Smith. The strength of the subset type in Martin-Löf's type theory. In Proceedings of LICS'88, pages 384-391. IEEE Computer Society Press, 1988.
34. [WCPW02] 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. Revised May 2003.