Filters








6 Hits in 3.5 sec

Mechanized Metatheory for the Masses: The PoplMark Challenge [chapter]

Brian E. Aydemir, Aaron Bohannon, Matthew Fairbairn, J. Nathan Foster, Benjamin C. Pierce, Peter Sewell, Dimitrios Vytiniotis, Geoffrey Washburn, Stephanie Weirich, Steve Zdancewic
2005 Lecture Notes in Computer Science  
We seek to push it over the threshold, making the use of proof tools common practice in programming language research-mechanized metatheory for the masses.  ...  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  ...  The Challenge Our challenge problems are taken from the basic metatheory of System F <: .  ... 
doi:10.1007/11541868_4 fatcat:6eprs3kxvjg67ak2zhuipl5qyu

It Is Time to Mechanize Programming Language Metatheory [chapter]

Benjamin C. Pierce, Peter Sewell, Stephanie Weirich, Steve Zdancewic
2008 Lecture Notes in Computer Science  
Our goal is to push the boundaries of existing technology to the point where we can achieve mechanized metatheory for the masses.  ...  We have proposed the POPLMark challenge as a concrete set of benchmarks intended both for measuring progress in this area and for stimulating discussion and collaboration.  ...  Mechanized Metatheory for the Masses One significant obstacle to achieving the goal of verified software is reasoning about the languages in which the software is written.  ... 
doi:10.1007/978-3-540-69149-5_3 fatcat:ir6cbgtimrb45kpuwqqrg3h4re

Mechanized Metatheory Revisited: An Extended Abstract (Invited Paper)

Dale Miller, Michael Wagner
2018 Types for Proofs and Programs  
I put forward the argument that bindings are such an intimate aspect of the structure of expressions that they should be accounted for directly in the underlying programming language support for proof  ...  The roots of such an approach can be found in the mobility of binders between term-level bindings, formula-level bindings (quantifiers), and proof-level bindings (eigenvariables).  ...  While the POPLmark challenge was based on the assumption that increments to existing provers will solve the problems surrounding the mechanization of metatheory, I have argued and illustrated here that  ... 
doi:10.4230/lipics.types.2016.1 dblp:conf/types/Miller16 fatcat:ryflgp5aqvh4pjd7x6jff3keky

Mechanized Metatheory Revisited

Dale Miller
2018 Journal of automated reasoning  
We put forward the argument that bindings are such an intimate aspect of the structure of expressions that they should be accounted for directly in the underlying programming language support for proof  ...  When proof assistants and theorem provers implement the metatheory of logical systems, they must deal with a range of syntactic expressions (e.g., types, formulas, and proofs) that involve variable bindings  ...  I thank Gopalan Nadathur and the anonymous reviewers for their many helpful comments on an earlier draft of this paper. This work was funded in part by the ERC Advanced Grant ProofCert.  ... 
doi:10.1007/s10817-018-9483-3 fatcat:sgmm2r4hn5ab3mgpvvzwhcjs5i

Psi-Calculi in Isabelle

Jesper Bengtson, Joachim Parrow, Tjark Weber
2015 Journal of automated reasoning  
This paper presents a mechanisation of psi-calculi, a parametric framework for modelling various dialects of process calculi including (but not limited to) the pi-calculus, the applied pi-calculus, and  ...  Proofs of meta-theoretic properties for psi-calculi are more involved, however, not least because psi-calculi (unlike simpler calculi) utilise binders that bind multiple names at once.  ...  Acknowledgements We want to convey our sincere thanks to Stefan Berghofer for his hard work on enhancing Nominal Isabelle to include the features that we needed for this formalisation.  ... 
doi:10.1007/s10817-015-9336-2 fatcat:6xd44jmybzftljt2j3zc7kadzm

LIPIcs, Volume 97, TYPES'16, Complete Volume [article]

Silvia Ghilezan, Herman Geuvers, Jelena Ivetić
2018
We also thank anonymous reviewers for providing detailed and useful comments. The category-theoretic argument for the representation theorem was contributed by Steve Awodey.  ...  The first author also wishes to thank Cyril Cohen and Enrico Tassi for advice and enhancement suggestions for our under tactic.  ...  While the POPLmark challenge was based on the assumption that increments to existing provers will solve the problems surrounding the mechanization of metatheory, I have argued and illustrated here that  ... 
doi:10.4230/lipics.types.2016 fatcat:abicdkmgbzebpkjwhrunsgjjim