Mechanizing Metatheory Without Typing Contexts (original) (raw)

Access this article

Log in via an institution

Subscribe and save

• Starting from 10 chapters or articles per month
• Access and download chapters and articles from more than 300k books and 2,500 journals
• Cancel anytime View plans

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

References

1. Aydemir, B., Bohannon, A., Fairbairn, M., Foster, J.N., Pierce, B.C., Sewell, P., Vytiniotis, D., Washburn, G., Weirich, S., Zdancewic, S.: Mechanized metatheory for the masses: the PoplMark challenge. In: Hurd, J., Melham, T.F. (eds.) Proceedings of the Eighteenth International Conference on Theorem Proving in Higher Order Logics (TPHOLs 2005), pp. 50–65. Springer (2005)
2. Aydemir, B., Charguéraud, A., Pierce, B.C., Pollack, R., Weirich, S.: Engineering formal metatheory. In: Proceedings of the 35th annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL ’08, pp. 3–15. ACM (2008)
3. Charguéraud, A.: http://www.chargueraud.org/research/2006/poplmark/ (2006)
4. Church, A.: A formulation of the simple theory of types. J. Symbolic Logic 5(2), 56–68 (1940)
   Article MathSciNet Google Scholar
5. Curry, H.B., Feys, R.: Combinatory Logic. North-Holland (1958)
6. de Bruijn. N.G.: Lambda calculus notation with nameless dummies. A tool for automatic formula manipulation with application to the church-rosser theorem. Indagat. Math. 34, 381–392 (1972)
   Article Google Scholar
7. Garrigue, J.: A certified implementation of ML with structural polymorphism. In: Proceedings of the 8th Asian conference on Programming Languages and Systems, APLAS’10, pp. 360–375. Springer-Verlag (2010)
8. Geuvers, H., Krebbers, R., McKinna, J., Wiedijk, F.: Pure type systems without explicit contexts. In: Proceedings of the 5th International Workshop on Logical Frameworks and Meta-languages (LFMTP), pp. 53–67 (2010)
9. Gordon, A.D.: A mechanisation of name-carrying syntax up to alpha-conversion. In: Proceedings of the 6th International Workshop on Higher Order Logic Theorem Proving and its Applications, pp. 413–425. Springer-Verlag (1994)
10. Harper, R., Honsell, F., Plotkin G.: A framework for defining logics. J. ACM 40, 143–184 (1993)
    Article MATH MathSciNet Google Scholar
11. Krebbers, R.: A formalization of Γ ∞ in Coq. http://robbertkrebbers.nl/research/gammainf (2010)
12. Leroy, X.: A locally nameless solution to the POPLmark challenge. Research report 6098, INRIA (2007)
13. Mazurak, K., Zhao, J., Zdancewic, S.: Lightweight linear types in System F°. In: Proceedings of the 5th ACM SIGPLAN Workshop on Types in Language Design and Implementation, TLDI ’10, pp. 77–88. ACM (2010)
14. McKinna, J., Pollack, R.: Pure type systems formalized. In: Proceedings of the International Conference on Typed Lambda Calculi and Applications, pp. 289–305. Springer-Verlag (1993)
15. McKinna, J., Pollack, R.: Some lambda calculus and type theory formalized. J. Autom. Reasoning 23, 373–409 (1999)
    Article MATH MathSciNet Google Scholar
16. Montagu, B.: Experience report: mechanizing core F-zip using the locally nameless approach (extended abstract). In: 5th ACM SIGPLAN Workshop on Mechanizing Metatheory (2010)
17. Pfenning, F., Elliott, C.: Higher-order abstract syntax. In: Proceedings of the ACM SIGPLAN 1988 Conference on Programming Language Design and Implementation, PLDI ’88, pp. 199–208. ACM (1988)
18. Pfenning, F., Schürmann, C.: System description: Twelf - a meta-logical framework for deductive systems. In: Proceedings of the 16th International Conference on Automated Deduction (CADE-16), pp. 202–206. Springer-Verlag LNAI (1999)
19. Pitts, A.M.: Nominal logic, a first order theory of names and binding. Inf. Comput. 186(2), 165–193 (2003)
    Article MATH MathSciNet Google Scholar
20. Pollack R., Sato M., Ricciotti, W.: A canonical locally named representation of binding. J. Autom. Reasoning 49(2), 185–207 (2012)
    Article MATH MathSciNet Google Scholar
21. Rossberg A., Russo C.V., Dreyer, D.: F-ing modules. In: Proceedings of the 5th ACM SIGPLAN Workshop on Types in Language Design and Implementation, TLDI ’10, pp. 89–102. ACM (2010)
22. Urban, C.: Nominal techniques in Isabelle/HOL. J. Autom. Reasoning 40, 327–356 (2008)
    Article MATH MathSciNet Google Scholar

Download references