Refinement types as proof irrelevance

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

Volumn 5608 LNCS, Issue , 2009, Pages 157-171

  Lovas, William ^a   Pfenning, Frank ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CORRECTNESS PROOFS; DEPENDENT TYPES; LOGICAL FRAMEWORKS; PROOF IRRELEVANCE; TYPE THEORY;

BIOMINERALIZATION; PATHOLOGY;

FORMAL LOGIC;

EID: 70350319283     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-02273-9_13     Document Type: Conference Paper

References (17)

1. Awodey, S., Bauer, A.: Propositions as [types]. Journal of Logic and Computation 14(4), 447-471 (2004)
2. Breazu-Tannen, V., Coquand, T., Gunter, C.A., Scedrov, A.: Inheritance as implicit coercion. Information and Computation 93(1), 172-221 (1991)
3. Constable, R.L., et al.: Implementing Mathematics with the Nuprl Proof Development System. Prentice-Hall, Englewood Cliffs (1986)
4. Davies, R.: Practical Refinement-Type Checking. PhD thesis, Carnegie Mellon University (May 2005); Available as Technical Report CMU-CS-05-110
5. Dunfield, J.: A Unified System of Type Refinements. PhD thesis, Carnegie Mellon University (August 2007); Available as Technical Report CMU-CS-07-129
6. Dunfield, J., Pfenning, F.: Tridirectional typechecking. In: Leroy, X. (ed.) ACM Symp. Principles of Programming Languages (POPL 2004), Venice, Italy, pp. 281-292 (January 2004)
7. Freeman, T.: Refinement Types for ML. PhD thesis, Carnegie Mellon University (March 1994); Available as Technical Report CMU-CS-94-110
8. Harper, R., Honsell, F., Plotkin, G.: A framework for defining logics. Journal of the Association for Computing Machinery 40(1), 143-184 (1993)
9. Liquori, L., Ronchi Della Rocca, S.: Intersection-types à la Church. Information and Computation 205(9), 1371-1386 (2007)
10. Lovas, W., Pfenning, F.: A bidirectional refinement type system for LF. Electronic Notes in Theoretical Computer Science 196, 113-128 (2008)
11. Pfenning, F.: Intensionality, extensionality, and proof irrelevance in modal type theory. In: Halpern, J. (ed.) Proceedings of the 16th Annual Symposium on Logic in Computer Science (LICS 2001), Boston, Massachusetts, pp. 221-230. IEEE Computer Society Press, Los Alamitos (2001)
12. Reed, J., Pfenning, F.: Proof irrelevance in a logical framework. Unpublished draft (July 2008)
13. Reynolds, J.C.: The coherence of languages with intersection types. In: Ito, T., Meyer, A.R. (eds.) TACS 1991. LNCS, vol. 526, pp. 675-700. Springer, Heidelberg (1991)
14. Salvesen, A., Smith, J.M.: The strength of the subset type in Martin-Löf's type theory. In: Proceedings of LICS 1988, pp. 384-391. IEEE Computer Society Press, Los Alamitos (1988)
15. Schürmann, C.: Towards practical functional programming with logical frameworks (July 2003), http://cs-www.cs.yale.edu/homes/carsten/delphin/ (unpublished)
16. Watkins, K., Cervesato, I., Pfenning, F., Walker, D.: 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)
17. Zeilberger, N.: Refinement types and computational duality. In: PLPV 2009: Proceedings of the 3rd workshop on Programming Languages Meets Program Verification, pp. 15-26. ACM, New York (2009)