Mechanized metatheory for the masses: The PoplMark challenge

Lecture Notes in Computer Science

Volumn 3603, Issue , 2005, Pages 50-65

  Aydemir, Brian E ^a   Bohannon, Aaron ^a   Fairbairn, Matthew ^b   Foster, J Nathan ^a   Pierce, Benjamin C ^a   Sewell, Peter ^b   Vytiniotis, Dimitrios ^a   Washburn, Geoffrey ^a   Weirich, Stephanie ^a   Zdancewic, Steve ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARKING; COMPUTER PROGRAMMING LANGUAGES; SET THEORY; SYNTACTICS;

ELECTRONIC APPENDIX; INDUCTION PRINCIPLES; METATHEORY; SUBTYPING;

THEOREM PROVING;

EID: 26844460326     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11541868_4     Document Type: Conference Paper

References (37)

1. Andrew W. Appel. Foundational proof-carrying code. In IEEE Symposium on Logic in Computer Science (LICS), Boston, Massachusetts, pages 247-258, June 2001.
2. Luca Cardelli. Extensible records in a pure calculus of subtyping. Research report 81, DEC/Compaq Systems Research Center, January 1992. Also in C. A. Gunter and J. C. Mitchell, editors, Theoretical Aspects of Object-Oriented Programming: Types, Semantics, and Language Design, MIT Press, 1994.
3. Luca Cardelli, Simone Martini, John C. Mitchell, and Andre Scedrov. An extension of System F with subtyping. Information and Computation, 109(1-2):4-56, 1994.
4. Summary in TACS '91 (Sendai, Japan, pp. 750-770).
5. Karl Crary. Toward a foundational typed assembly language. In ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL), New Orleans, Louisiana, pages 198-212, January 2003.
6. Louise A. Dennis. Inductive challenge problems, 2000. http://www.cs.nott.ac.uk/~lad/research/challenges.
7. Catherine Dubois and Valerie Menissier-Morain. Certification of a type inference tool for ML: Damas-Milner within Coq. Journal of Automated Reasoning, 23(3-4):319-346, 1999.
8. Robert W. Floyd. Assigning meanings to programs. In J. T. Schwartz, editor, Mathematical Aspects of Computer Science, volume 19 of Proceedings of Symposia in Applied Mathematics, pages 19-32, Providence, Rhode Island, 1967. American Mathematical Society.
9. Murdoch Gabbay and Andrew Pitts. A new approach to abstract syntax involving binders. In 14th Symposium on Logic in Computer Science, pages 214-224, 1999.
10. I. P. Gent and T. Walsh. CSPLib: a benchmark library for constraints. Technical Report APES-09-1999, APES, 1999. Available from http://www.dcs.st-and. ac.uk/~apes/apesreports.html. A shorter version appears in the Proceedings of the 5th International Conference on Principles and Practices of Constraint Programming (CP-99).
11. Giorgio Ghelli. Proof Theoretic Studies about a Minimal Type System Integrating Inclusion and Parametric Polymorphism. PhD thesis, Università di Pisa, 1990. Technical report TD-6/90, Dipartimento di Informatica, Università di Pisa.
12. Andrew D. Gordon and Tom Melham. Five axioms of alpha-conversion. In J. von Wright, J. Grundy, and J. Harrison, editors, Theorem Proving in Higher Order Logics: 9th International Conference, TPHOLs '96, volume 1125 of Lecture Notes in Computer Science, pages 173-190. Springer-Verlag, 1996.
13. Ian Green. The dream corpus of inductive conjectures, 1999. http://dream.dai.ed.ac.uk/dc/lib.html.
14. Elsa Gunter and Savi Maharaj. Studying the ML module system in HOL. The Computer Journal: Special Issue on Theorem Proving in Higher Order Logics, 38(2):142-151, 1995.
15. Tony Hoare. The verifying compiler: A grand challenge for computing research. J. ACM, 50(1):63-69, 2003.
16. Holger Hoos and Thomas Stuetzle. SATLIB. http://www.intellektik. informatik.tu-darmstadt.de/SATLIB/.
17. J. J. Joyce and C.-J. H. Seger, editors. Proceedings of the 6th International Workshop on Higher Order Logic Theorem Proving and its Applications (HUG'93), volume 780 of Lecture Notes in Computer Science, Vancouver, B.C., Canada, August 1993. Springer-Verlag, 1994.
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 Australia, Sydney, March 2004.
19. James McKinna and Robert Pollack. Some lambda calculus and type theory formalized. Journal of Automated Reasoning, 23(3-4), November 1999.
20. Robin Milner, Mads Tofte, Robert Harper, and David MacQueen. The Definition of Standard ML, Revised edition. MIT Press, 1997.
21. J Strother Moore. A grand challenge proposal for formal methods: A verified stack. In Bernhard K. Aichernig and T. S. E. Maibaum, editors, Formal Methods at the Crossroads. From Panacea to Foundational Support, 10th Anniversary Colloquium of UNU/IIST, Lisbon, Portugal, volume 2757 of Lecture Notes in Computer Science, pages 161-172. Springer, 2002.
22. J Strother Moore and George Porter. The apprentice challenge. ACM Trans. Program. Lang. Syst., 24(3): 193-216, 2002.
23. Wolfgang Naraschewski and Tobias Nipkow. Type inference verified: Algorithm W in Isabelle/HOL. Journal of Automated Reasoning, 23:299-318, 1999.
24. Tobias Nipkow, David von Oheimb, and Cornelia Pusch. μJava: Embedding a programming language in a theorem prover. In F.L. Bauer and R. Steinbrüggen, editors, Foundations of Secure Computation. Proc. Int. Summer School Marktoberdorf 1999, pages 117-144. IOS Press, 2000.
25. light is type-safe - definitely. In POPL '98: Proceedings of the 25th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 161-170, New York, NY, USA, 1998. ACM Press.
26. Michael Norrish. Formalising C in HOL. PhD thesis, Computer Laboratory, University of Cambridge, 1998.
27. Michael Norrish. Mechanising Hankin and Barendregt using the Gordon-Melham axioms. In MERLIN '03: Proceedings Of The 2003 Workshop On Mechanized Reasoning About Languages With Variable Binding, pages 1-7. ACM Press, 2003.
28. Michael Norrish. Recursive function definition for types with binders. In Konrad Slind, Annette Bunker, and Ganesh Gopalakrishnan, editors, Theorem Proving in Higher Order Logics: 17th International Conference, TPHOLs 2004, volume 3223 of Lecture Notes In Computer Science, pages 241-256. Springer-Verlag, 2004.
29. Frank Pfenning and Conal Elliot. Higher-order abstract syntax. In PLDI '88: Proceedings of the ACM SIGPLAN 1988 Conference on Programming Language Design and Implementation, pages 199-208. ACM Press, 1988.
30. Benjamin C. Pierce. Types and Programming Languages. MIT Press, 2002.
31. Andrew M. Pitts. Nominal logic, a first order theory of names and binding. Inf. Comput., 186(2):165-193, 2003.
32. Geoff Sutcliffe and Christian Suttner. The TPTP problem library. Journal of Automated Reasoning, 21(2):177-203, 1998.
33. Donald Syme. Reasoning with the formal definition of Standard ML in HOL. In Joyce and Seger [16], pages 43-60.
34. Christian Urban and Christine Tasson. Nominal techniques in Isabelle/HOL. Accepted at CADE-20 in Tallinn. See http://www.mathematik.uni-muenchen.de/ ~urban/nominal/.
35. Myra VanInwegen and Elsa Gunter. HOL-ML. In Joyce and Seger [16], pages 61-74.
36. René Vestergaard and James Brotherston. The mechanisation of Barendregt-style equational proofs (the residual perspective). In Mechanized Reasoning about Languages with Variable Binding (MERLIN), volume 58 of Electronic Notes in Theoretical Computer Science. Elsevier, 2001.
37. René Vestergaard and James Brotherston. A formalised first-order confluence proof for the λ-calculus using one-sorted variable names. Information and Computation, 183(2):212 - 244, 2003. Special edition with selected papers from RTA01.