A Bidirectional Refinement Type System for LF

Electronic Notes in Theoretical Computer Science

Volumn 196, Issue C, 2008, Pages 113-128

  Lovas, William ^a   Pfenning, Frank ^a  

^a Carnegie Mellon University   (United States)

Author keywords

dependent types; intersection types; LF; refinement types; subtyping

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; LOGIC PROGRAMMING; MODEL CHECKING;

INTERSECTION TYPES; REFINEMENT TYPES; SUBTYPING;

COMPUTABILITY AND DECIDABILITY;

EID: 38549178320     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2007.09.021     Document Type: Article

References (17)

1. Aspinall D. Subtyping with power types. In: Clote P., and Schwichtenberg H. (Eds). CSL. Lecture Notes in Computer Science volume 1862 (2000), Springer 156-171
2. Aspinall D., and Compagnoni A.B. Subtyping dependent types. Theoretical Computer Science 266 1-2 (2001) 273-309
3. Crary K. Toward a foundational typed assembly language. In: Morrisett G. (Ed). Proceedings of the 30th Annual Symposium on Principles of Programming Languages. (POPL '03), New Orleans, Louisiana (January 2003), ACM Press 198-212
4. Rowan Davies. Practical Refinement-Type Checking. PhD thesis, Carnegie Mellon University, May 2005. Available as Technical Report CMU-CS-05-110
5. Tim Freeman. Refinement Types for ML. PhD thesis, Carnegie Mellon University, March 1994. Available as Technical Report CMU-CS-94-110
6. Harper R., Honsell F., and Plotkin G. A framework for defining logics. Journal of the Association for Computing Machinery 40 1 (January 1993) 143-184
7. Robert Harper and Daniel R. Licata. Mechanizing metatheory in a logical framework. Journal of Functional Programming, 2007. To appear. Available from http://www.cs.cmu.edu/~drl/
8. Harper R., and Pfenning F. On equivalence and canonical forms in the LF type theory. Transactions on Computational Logic 6 (January 2005) 61-101
9. Lee D.K., Crary K., and Harper R. Towards a mechanized metatheory of Standard ML. In: Felleisen M. (Ed). Proceedings of the 34th Annual Symposium on Principles of Programming Languages. (POPL '07), Nice, France (January 2007), ACM Press 173-184
10. William Lovas and Frank Pfenning. A bidirectional refinement type system for LF. Technical Report CMU-CS-07-127, Department of Computer Science, Carnegie Mellon University, 2007
11. Aleksandar Nanevski, Frank Pfenning, and Brigitte Pientka. Contextual modal type theory. Transactions on Computational Logic, 2007. To appear
12. 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
13. Pfenning F. Logical frameworks. In: Robinson A., and Voronkov A. (Eds). Handbook of Automated Reasoning (2001), Elsevier Science and MIT Press 1063-1147 chapter 17
14. Pfenning F., and Schürmann C. System description: Twelf - a meta-logical framework for deductive systems. In: Ganzinger H. (Ed). Proceedings of the 16th International Conference on Automated Deduction. (CADE-16), Trento, Italy. LNAI 1632 (July 1999), Springer-Verlag 202-206
15. John C. Reynolds. Even normal forms can be hard to type. Unpublished, marked Carnegie Mellon University, December 1, 1989
16. John C. Reynolds. Design of the programming language Forsythe. Report CMU-CS-96-146, Carnegie Mellon University, Pittsburgh, Pennsylvania, June 28, 1996
17. 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