A simplified account of the metatheory of linear LF

Electronic Notes in Theoretical Computer Science

Volumn 70, Issue 2, 2002, Pages 11-28

  Vanderwaart, Joseph C ^a   Crary, Karl ^a  

^a Carnegie Mellon University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; ALGORITHMS; PROBLEM SOLVING; THEOREM PROVING;

RESOURCE CONSUMPTION;

METADATA;

EID: 18944373360     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)80503-6     Document Type: Conference Paper

References (10)

1. Iliano Cervesato and Frank Pfenning. A linear logical framework. In Eleventh IEEE Symposium on Logic in Computer Science, pages 264-275, July 1996.
2. Coquand Thierry. An algorithm for testing conversion in type theory. Huet Gérard, Plotkin Gordon. Logical Frameworks. 1991;255-279 Cambridge University Press
3. Karl Crary and Joseph C. Vanderwaart. An expressive, scalable type theory for certified code. Technical Report CMU-CS-01-113, Carnegie Mellon University, May 2001.
4. Felty Amy. Encoding dependent types in intuitionistic logic. Huet Gérard, Gordon Plotkin D. Logical Frameworks. 1991;214-251 Cambridge University Press
5. Harper Robert, Honsell Furio, Plotkin Gordon. A framework for defining logics. Journal of the Association for Computing Machinery. 40:(1):January 1993;143-184
6. Robert Harper and Frank Pfenning. On equivalence and canonical forms in the LF type theory. Technical Report CMU-CS-99-159, Carnegie Mellon University, September 1999.
7. Robert Harper and Frank Pfenning. On equivalence and canonical forms in the LF type theory. Technical Report CMU-CS-00-148, Carnegie Mellon University, July 2000.
8. Frank Pfenning. Personal communication.
9. Jeff Polakow. Ordered Linear Logic and Applications. PhD thesis, Carnegie Mellon University, August 2001. Available as Technical Report CMU-CS-01-152.
10. Joseph C. Vanderwaart and Karl Crary. A simplified account of the metatheory of Linear LF. Technical report, Carnegie Mellon University, 2002.