A syntactic account of singleton types via hereditary substitution

ACM International Conference Proceeding Series

Volumn , Issue , 2009, Pages 21-29

  Crary, Karl ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Logical frameworks; Mechanized metatheory; Singleton types

Indexed keywords

CANONICAL FORM; LOGICAL FRAMEWORKS; MATHEMATICAL FOUNDATIONS; META-LOGIC; META-THEORY; MODULE SYSTEMS; PROOF THEORY; STANDARD ML;

COMPUTABILITY AND DECIDABILITY; LINGUISTICS;

SYNTACTICS;

EID: 70450189292     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1577824.1577829     Document Type: Conference Paper

References (15)

1. David Aspinall. Subtyping with singleton types. In Eighth International Workshop on Computer Science Logic, volume 933 of Lecture Notes in Computer Science, pages 1-15, Kazimierz, Poland, September 1994. Springer.
2. Karl Crary. Sound and complete elimination of singleton kinds. ACM Transactions on Computational Logic, 8(2), April 2007. An earlier version appeared in 2003 Workshop on Types in Compilation.
3. Karl Crary. Explicit contexts in LF. In Workshop on Logical Frameworks and Meta-Languages: Theory and Practice, Pittsburgh, Pennsylvania, 2008.
4. Amy Felty. Encoding dependent types in an intuitionistic logic. In Logical Frameworks, pages 214-251. Cambridge University Press, 1991.
5. Robert Harper, Furio Honsell, and Gordon Plotkin. A framework for defining logics. Journal of the ACM, 40(1):143-184, January 1993.
6. Robert Harper and Daniel R. Licata. Mechanizing metatheory in a logical framework. Journal of Functional Programming, 17(4-5), July 2007.
7. R. Hindley. Reductions of residuals are finite. Transactions of the American Mathematical Society, 240, 1978.
8. Daniel K. Lee, Karl Crary, and Robert Harper. Towards a mechanized metatheory of Standard ML. In Thirty-Fourth ACM Symposium on Principles of Programming Languages, Nice, France, January 2007.
9. Xavier Leroy. The Objective Caml System, Release 1.00. Institut National de Recherche en Informatique et Automatique (INRIA), 1996.
10. Robin Milner, Mads Tofte, Robert Harper, and David MacQueen. The Definition of Standard ML (Revised). The MIT Press, Cambridge, Massachusetts, 1997.
11. Frank Pfenning and Carsten Schürmann. Twelf User's Guide, Version 1.4, 2002. Available electronically at http://www.cs.cmu.edu/~twelf.
12. Claudio V. Russo. Types for Modules. Number 60 in Electronic Notes in Theoretical Computer Science. Elsevier, January 2003.
13. Christopher A. Stone and Robert Harper. Deciding type equivalence in a language with singleton kinds. In Twenty-Seventh ACM Symposium on Principles of Programming Languages, Boston, January 2000. Extended version published as CMU technical report CMU-CS-99-155.
14. Christopher A. Stone and Robert Harper. Extensional equivalence and singleton types. ACM Transactions on Computational Logic, 7(4), October 2006. An earlier version appeared in the 2000 Symposium on Principles of Programming Languages.
15. Kevin Watkins, Iliano Cervesato, Frank Pfenning, and David Walker. A concurrent logical framework I: Judgments and properties. Technical Report CMU-CS-02-101, Carnegie Mellon University, School of Computer Science, 2002. Revised May 2003.