Brian E. Aydemir, Aaron Bohannon, Matthew Fairbairn, J. Nathan Foster, Benjamin C. Pierce, Peter Sewell, Dimitrios Vytiniotis, Georey Washburn, Stephanie Weirich, Steve Zdancewic  Home/Search
Context Related
| upenn.edu/~geoffw/rese...poplmark.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: upenn.edu/~geoffw/research/ (more) Homepages: G.Washburn |
Rate this article:      (best)Comment on this article |
Abstract: How close are we to a world where every paper on programming languages is accompanied by an electronic appendix with machine-checked proofs? We propose a concrete set of benchmarks for measuring progress in this area. Based on the metatheory of System F , a typed lambda-calculus with second-order polymorphism, subtyping, and records, these benchmarks embody many aspects of programming languages that are challenging to formalize: variable binding at both the term and type levels, syntactic forms ... (Update)
Cited by: More
It is Time to Mechanize Programming Language Metatheory - Pierce, Sewell, Weirich.. (Correct)
Mechanizing Language Definitions - Harper, Licata (2006) (Correct)
A Computational Approach to Reflective Meta-Reasoning.. - Nogin, Kopylov, Yu.. (2005) (Correct)
Active bibliography (related documents): More All
3.7: Mechanized Metatheory for the Masses: The PoplMark.. - Aydemir, Bohannon.. (2005) (Correct)
0.4: Executing Higher Order Logic - Berghofer, Nipkow (2000) (Correct)
0.4: Formal Verification of Time-Triggered Systems - Pike (2006) (Correct)
Similar documents based on text: More All
0.5: An Open and Shut Typecase - Vytiniotis, Washburn, Weirich (2004) (Correct)
0.2: Location-Independent Communication for Mobile Agents.. - Sewell.. (1998) (Correct)
0.2: Analyzing Polymorphic Advice - Dantas, Walker, Washburn, Weirich (2004) (Correct)
Related documents from co-citation: More All
3: Implementing Mathematics with the Nuprl Proof Development System - Constable - 1986
3: Computer Science Department (context) - Thompson, Shirley et al. - 1998
3: Justifying calculational logic by a conventional metalinguistic semantics (context) - Aaron, Allen - 1999
BibTeX entry: (Update)
Brian E. Aydemir, Aaron Bohannon, Matthew Fairbairn, J. Nathan Foster, Benjamin C. Pierce, Peter Sewell, Dimitrios Vytiniotis, Geoffrey Washburn, Stephanie Weirich, and Steve Zdancewic. Mechanized metatheory for the masses: The POPLmark Challenge. In Proceedings of the Eighteenth International Conference on Theorem Proving in Higher Order Logics (TPHOLs 2005. http://citeseer.ist.psu.edu/article/aydemir05mechanized.html More
@inproceedings{ aydemir05mechanized,
author = "B. Aydemir and A. Bohannon and M. Fairbairn and J. Foster and B. Pierce
and P. Sewell and D. Vytiniotis and G. Washburn and S. Weirich and S. Zdancewic",
title = "Mechanized metatheory for the masses: The {POPLmark} Challenge",
booktitle = "Proceedings of the Eighteenth International Conference on Theorem Proving
in Higher Order Logics (TPHOLs 2005)",
year = "2005",
url = "citeseer.ist.psu.edu/article/aydemir05mechanized.html" }
Citations (may not include all citations):592 Introduction to HOL: a theorem proving environment for highe.. (context) - Gordon, Melham - 1993
505 Implementing Mathematics with the NuPRL Proof Development Sy.. - Constable, Allen et al. - 1986
384 The Definition of Standard ML (context) - Milner, Tofte et al. - 1997
223 Assigning meanings to programs (context) - Floyd - 1967
191 The LEGO proof development system: A user's manual (context) - Luo, Pollack - 1992
172 Higher-order abstract syntax (context) - Pfenning, Elliot - 1988
136 System description: Twelf --- A metalogical framework for de.. - Pfenning, Schurmann - 1999
134 PVS: Combining specification (context) - Owre, Rajan et al. - 1996
128 On understanding types (context) - Cardelli, Wegner - 1985
117 Featherweight Java: A minimal core calculus for Java and GJ - Igarashi, Pierce et al. - 2001
106 Lambda calculus notation with nameless dummies (context) - de Bruijn - 1972
74 Computer-Aided Reasoning: An Approach (context) - Kaufmann, Moore et al. - 2000
69 IsabelleHOL Proof Assistant Higher Order Logic (context) - Lawrence, Markus et al. - 2002
66 A new approach to abstract syntax involving binders - Gabbay, Pitts - 1999
64 Types and Programming Languages (context) - Pierce - 2002
47 Extensible records in a pure calculus of subtyping - Cardelli - 1994
46 revised edition (context) - Barendregt, Calculus - 1984
45 Synthesis of ML programs in the system Coq (context) - Paulin-Mohring, Werner - 1993
44 Proof Theoretic Studies about a Minimal Type System Integrat.. (context) - Ghelli - 1990
32 a first order theory of names and binding - Pitts - 2003
31 Five axioms of alpha-conversion - Gordon, Melham - 1996
17 Some lambda calculus and type theory formalized - McKinna, Pollack - 1999
15 Coherence of subsumption: Minimum typing and type-checking i.. (context) - Curien, Ghelli - 1994
14 Information and Computation (context) - Cardelli, Martini et al. - 1994
10 Executing higher order logic - Berghofer, Nipkow - 2002
7 The verifying compiler: A grand challenge for computing rese.. (context) - Hoare - 2003
7 An axiomatic approach to metareasoning on nominal algebras i.. - Honsell, Miculan et al. - 2001
7 Executing HOL specifications: Towards an evaluation semantic.. (context) - Rajan - 1993
6 Interactive Theorem Proving and Program Development (context) - Bertot, Castran - 2004
5 A definitional approach to primitive recursion over higher o.. - Ambler, Crole et al. - 2003
5 The TPTP problem library (context) - Sutcli, Christian - 1998
4 fully executable compiler from a proof assistant (context) - Berghofer, Strecker et al. - 2003
4 A grand challenge proposal for formal methods: A verified st.. (context) - Moore - 2002
3 Inductive challenge problems (context) - Dennis - 2000
3 The dream corpus of inductive conjectures (context) - Green - 1999
3 Executing formal specifications by translation to higher ord.. - Andrews - 1997
3 A formalised first-order confluence proof for the #-calculus.. (context) - Vestergaard, Brotherston - 2003
2 The mechanisation of Barendregt-style equational proofs (context) - Vestergaard, Brotherston - 2001
2 Available from http://csplib (context) - Gent, Walsh et al. - 1999
2 Mechanising Hankin and Barendregt using the Gordon-Melham ax.. (context) - Norrish - 2003
2 Recursive function definition for types with binders (context) - Norrish - 2004
1 Program extraction in simply-typed higher order logic - Berghofer - 2002
1 The apprentice challenge (context) - Moore, Porter - 2002
http://www.intellektik.informatik
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cis.upenn.edu/~geoffw/research/): More
Wobbly Types: Type Inference for Generalised Algebraic Data .. - Jones, Washburn, Weirich (2004) (Correct)
Implementing Compositional Analysis Using Intersection.. - Kfoury, Washburn, Wells (2002) (Correct)
An Open and Shut Typecase - Vytiniotis, Washburn, Weirich (2004) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC