Towards a mechanized metatheory of standard ML

Conference Record of the Annual ACM Symposium on Principles of Programming Languages

Volumn , Issue , 2007, Pages 173-184

  Lee, Daniel K ^a   Crary, Karl ^a   Harper, Robert ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Language definitions; Logical frameworks; Mechanized metatheory; Standard ML; Twelf; Type safety

Indexed keywords

METADATA; RECURSIVE FUNCTIONS; SEMANTICS;

LANGUAGE DEFINITIONS; LOGICAL FRAMEWORKS; MECHANIZED METATHEORY; STANDARD ML; TWELF; TYPE SAFETY;

MACHINE ORIENTED LANGUAGES;

EID: 34548282545     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1190216.1190245     Document Type: Conference Paper

References (41)

1. H. P. Barendregt. The Lambda Calculus: Its Syntax and Semantics. Elsevier, 1984.
2. Karl Crary and Susm.it Sarkar. Foundational certified code in a metalogical framework. In Nineteenth International Conference on Automated Deduction, Miami, Florida, 2003. Extended version published as CMU technical report CMU-CS-03-108.
3. Luis Damas and Robin Milner. Principal type-schemes for functional programs. In Ninth ACM Symposium on Principles of Programming Languages, pages 207-212, Albuquerque, New Mexico, January 1982.
4. Joëlle Despeyroux, Amy Felty, and André Hirschowitz. Higher-order syntax in Coq. In 1995 International Conference on Typed Lambda Calculi and Applications, volume 905 of Lecture Notes in Computer Science, Edinburgh, April 1995. Springer-Verlag.
5. Derek Dreyer. Understanding and Evolving the ML Module System. PhD thesis, Carnegie Mellon University, School of Computer Science, Pittsburgh, Pennsylvania, May 2005.
6. Derek Dreyer, Karl Crary, and Robert Harper. A type system for higher-order modules. In Thirtieth ACM Symposium on Principles of Programming Languages, pages 236-249, New Orleans, Louisiana, January 2003.
7. Derek Dreyer, Robert Harper, Manuel M.T. Chakravarty, and Gabriele Keller. Modular type classes. Technical Report TR-2006-03, University of Chicago, April 2006.
8. Sophia Drossopoulou and Susan Eisenbach. Towards an operational semantics and proof of type soundness for Java. In Formal Syntax and Semantics of Java. Springer-Verlag, March 1998.
9. Sophia Drossopoulou, Tanya Valkevych, and Susan Eisenbach. Java type soundness revisited, September 2000. Technical report, Imperial College London.
10. Michael J. C. Gordon and Tom F. Melham. Introduction to HOL: A Theorem Proving Environment for Higher-Order Logic. Cambridge University Press, 1993.
11. Robert Harper. A simplified account of polymorphic references. Information Processing Letters, 51(4):201-206, 1994.
12. Follow-up note in Information Processing Letters, 57(1), 1996.
13. Robert Haiper, Furio Honsell, and Gordon Plotkin. A framework for defining logics. Journal of the ACM, 40(1): 143-184, January 1993.
14. Robert Harper and Daniel R. Licata. Mechanizing language definitions. Submitted for publication, April 2006.
15. Robert Harper and Mark Lillibridge. A type-theoretic approach to higher-order modules with sharing. In Twenty-First ACM Symposium on Principles of Programming Languages, pages 123-137, Portland, Oregon, January 1994.
16. Robert Harper, John C. Mitchell, and Eugenio Moggi. Higher-order modules and the phase distinction. In Seventeenth ACM Symposium on Principles of Programming Languages, pages 341-354, San Francisco, January 1990.
17. Robert Harper and Chris Stone. A type-theoretic interpretation of Standard ML. In Proof, Language and Interaction: Essays in Honour of Robin Milner: The MIT Press, 2000. Extended version published as CMU technical report CMU-CS-97-147.
18. Gerwin Klein and Tobias Nipkow. A machine-checked model for a Java-like language, virtual machine and compiler. Technical Report 0400001T.1, National ICT Ausu-alia, Sydney, March 2004.
19. Daniel K. Lee, Karl Crary, and Robert Harper. Mechanizing the metatheory of Standard ML. Technical Report CMU-CS-06-138, Carnegie Mellon University, School of Computer Science, 2006.
20. Xavier Leroy. Manifest types, modules and separate compilation. In Twenty-First ACM Symposium on Principles of Programming Languages, pages 109-122, Portland, Oregon, January 1994.
21. Xavier Leroy. Applicative functors and fully transparent higherorder modules. In Twenty-Second ACM Symposium on Principles of Programming Languages, San Francisco, January 1995.
22. Robin Milner, Mads Tofte, Robert Harper, and David MacQueen. The Definition of Standard ML (Revised). The MIT Press, Cambridge, Massachusetts, 1997.
23. Greg Morrisett, Matthias Felleisen, and Robert Harper. Abstract models of memory management. In Conference on Functional. Pmgramming Languages and Computer Architecture, pages 66-77, La Jolla, California, June 1995.
24. Lawrence C. Paulson. The foundation of a generic theorem prover. Journal of Automated Reasoning, 5:363-397, 1989.
25. Leaf Petersen. Certfying Compilation for Standard ML in a Type Analysis Framework. PhD thesis, Carnegie Mellon University, School of Computer Science, Pittsburgh, Pennsylvania, 2005.
26. Leaf Petersen, Perry Cheng, Robert Harper, and Chris Stone. Implementing the TILT internal language. Technical Report CMU-CS-00-180, Carnegie Mellon University, School of Computer Science, December 2000.
27. Frank Pfenning. Computation and deduction. Lecture notes, available electronically at http ://www.cs.emu.edu/"twelf.
28. Frank Pfenning and Carsten Schürmann. Twelf User's Guide, Version 1.4, 2002. Available electronically at http : //www.cs.emu.edu/"twelf.
29. Brigitte Pientka and Frank Pfenning. Termination, and reduction checking in the logical framework. In Workshop of Automation of Proofs by Mathematical Induction, June 2000.
30. Benjamin Pierce and Martin Steffen. Higher-order subtyping. Theoretical Computer-Science, 176(1-2):235-282, 1997.
31. Benjamin C. Pierce. Types and Programming Languages, chapter 13. The MIT Press, 2002.
32. Gordon. D. Plotkin. A structural approach to operational semantics. Technical Report DAIMI FN-19, University of Aarhus, 1981.
33. John C. Reynolds. The essence of Algol. In J. W. de Bakker and J. C. van Vliet, editors, Proceedings of the International Symposium on Algorithmic Languages, pages 345-372, Amsterdam, October 1981. North-Holland.
34. Jeffrey Sarnat and Carsten Schürmann. A proof-theoretic account of logical relations. Submitted for publication, 2006.
35. Christopher A. Stone. Singleton Kinds and Singleton Types. PhD thesis, Carnegie Mellon University, School of Computer Science, Pittsburgh, Pennsylvania, August 2000.
36. Christopher A. Stone and Robert Harper. Extensional equivalence and singleton types. ACM Transactions on Computational Logic, 2006? To appear. An earlier version, appeared in. the 2000 Symposium on. Principles of Programming Languages.
37. Donald Syme. Reasoning with the formal definition of Standard ML in HOL. In Sixth International Workshop on Higher Order Logic Theorem Proving and its Applications, pages 43-60, Vancouver, August 1993.
38. D. Tarditi, G. Morrisett, P. Cheng, C. Stone, R. Harper, and P. Lee. TTL: A type-directed optimizing compiler for ML. In 1996 SIGPLAN Conference on Programming Language Design and Implementation, pages 181-192, May 1996.
39. Myra Vanlnwegen. The Machine-Assisted Proof of Programming Language Pmperiies. PhD thesis, University of Pennsylvania, Philadelphia, Pennsylvania, May 1996.
40. Myra Vanlnwegen and Elsa Gunter. Hol-ml. In Sixth International Workshop on Higher Order Logic Theorem Pmving and its Applications, pages 61-74, Vancouver, August 1993.
41. Kevin Watkins, Iliano Cervesato, Frank Pfenning, and David Walker. A concurrent logical framework: The propositional fragment. In S. Berardi, M. Coppo, and F. Damiani, editors, Types for Proofs and Programs, volume 3085 of Lecture Notes in Computer Science, pages 355-377. Springer-Verlag, 2004. Papers from the Third International Workshop on Types for Proofs and Programs, April 2003, Torino, Italy.