It Is Time to Mechanize Programming Language Metatheory

Authors:
Benjamin C. Pierce;Peter Sewell;Stephanie Weirich;Steve Zdancewic
Affiliations:
Department of Computer and Information Science, University of Pennsylvania,;Computer Laboratory, University of Cambridge,;Department of Computer and Information Science, University of Pennsylvania,;Department of Computer and Information Science, University of Pennsylvania,
Venue:
Verified Software: Theories, Tools, Experiments
Year:
2005

Citing 16
Cited 0

On understanding types, data abstraction, and polymorphism

ACM Computing Surveys (CSUR) - The MIT Press scientific computation series
Implementing mathematics with the Nuprl proof development system

Implementing mathematics with the Nuprl proof development system
Introduction to HOL: a theorem proving environment for higher order logic

Introduction to HOL: a theorem proving environment for higher order logic
Coherence of subsumption, minimum typing and type-checking in F≤

Theoretical aspects of object-oriented programming
Featherweight Java: a minimal core calculus for Java and GJ

ACM Transactions on Programming Languages and Systems (TOPLAS)
The apprentice challenge

ACM Transactions on Programming Languages and Systems (TOPLAS)
The Definition of Standard ML

The Definition of Standard ML
Computer-Aided Reasoning: An Approach

Computer-Aided Reasoning: An Approach
The TPTP Problem Library

Journal of Automated Reasoning
The verifying compiler: A grand challenge for computing research

Journal of the ACM (JACM)
An Extension of System F with Subtyping

TACS '91 Proceedings of the International Conference on Theoretical Aspects of Computer Software
CSPLIB: A Benchmark Library for Constraints

CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
PVS: Combining Specification, Proof Checking, and Model Checking

CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
System Description: Twelf - A Meta-Logical Framework for Deductive Systems

CADE-16 Proceedings of the 16th International Conference on Automated Deduction: Automated Deduction
Interactive Theorem Proving and Program Development

Interactive Theorem Proving and Program Development
Mechanized metatheory for the masses: the PoplMark challenge

TPHOLs'05 Proceedings of the 18th international conference on Theorem Proving in Higher Order Logics

Quantified Score

Hi-index	0.00

Visualization

Abstract

How close are we to a world in which mechanically verified software is commonplace? A world in which theorem proving technology is used routinely by both software developers and programming language researchers alike? One crucial step towards achieving these goals is mechanized reasoning about language metatheory. The time has come to bring together the theorem proving and programming language communities to address this problem. We have proposed the POPLMarkchallenge as a concrete set of benchmarks intended both for measuring progress in this area and for stimulating discussion and collaboration. Our goal is to push the boundaries of existing technology to the point where we can achieve mechanized metatheory for the masses.