Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,286,940 papers from all fields of science
Search
Sign In
Create Free Account
POPLmark challenge
Known as:
POPLmark
In programming language theory, the POPLmark challenge (from "Principles of Programming Languages benchmark", formerly Mechanized Metatheory for the…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
18 relations
ATS
Automated reasoning
Coq (software)
Expression problem
Expand
Broader (1)
Formal methods
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
22nd International Conference on Types for Proofs and Programs, TYPES 2016, May 23-26, 2016, Novi Sad, Serbia
T. Coquand
Types for Proofs and Programs
2018
Corpus ID: 53217144
Proof assistants and the programming languages that implement them need to deal with a range of linguistic expressions that…
Expand
2013
2013
Towards Self-Verification of Isabelle ’ s Sledgehammer
J. Blanchette
,
A. Popescu
2013
Corpus ID: 17077407
This paper presents an Isabelle/HOL formalisation of recent research in automated reasoning: efficient encodings of sorts in…
Expand
2012
2012
A Rewriting View of Simple Typing
Aaron Stump
,
H. Zantema
,
Garrin Kimmell
,
Roba El Haj Omar
Log. Methods Comput. Sci.
2012
Corpus ID: 14968081
This paper shows how a recently developed view of typing as small-step ab- stract reduction, due to Kuan, MacQueen, and Findler…
Expand
2011
2011
A Solution to the PoplMark Challenge Based on de Bruijn Indices
Jérôme Vouillon
Journal of automated reasoning
2011
Corpus ID: 20574991
The PoplMark challenge proposes a set of benchmarks intended to assess the usability of proof assistants in the context of…
Expand
Review
2009
Review
2009
Formalizing Operational Semantic Specifications in Logic
D. Miller
Workshop on Functional and Constraint Logic…
2009
Corpus ID: 27207811
2009
2009
Logic Colloquium 2006: Higher-order abstract syntax in type theory
Venanzio Capretta
,
A. Felty
2009
Corpus ID: 15277353
We develop a general tool to formalize and reason about languages expressed using higher-order abstract syntax in a proof-tool…
Expand
2007
2007
A locally nameless solution to the POPLmark challenge
X. Leroy
2007
Corpus ID: 195982719
The POPLmark challenge is a collective experiment intended to assess the usability of theorem provers and proof assistants in the…
Expand
2006
2006
Machine Obstructed Proof How many months can it take to verify 30 assembly instructions
Nick Benton
2006
Corpus ID: 61190524
After years doing programming language theory without going near a proof assistant, I was finally convinced by the POPLmark ‘buzz…
Expand
Review
2006
Review
2006
An Overview of Calphaml
F. Pottier
ML Workshop
2006
Corpus ID: 16969726
2006
2006
Proving meta-theorems with Twelf
Daniel R. Licata
2006
Corpus ID: 115968373
Notes to proofreaders: • I haven't had time to do many of the adequacy proofs yet. If you know of a way of streamlining these, I…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE
or Only Accept Required