Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
POPLmark challenge
open-in-new
<p>In <a href="/facts/Programming_language_theory/MfecfTFI">programming language theory</a>, the POPLmark challenge (from "Principles of Programming Languages benchmark", formerly Mechanized Metatheory for the Masses!) (Aydemir, 2005) is a set of <a href="/facts/Benchmarking/7HKqj6aL">benchmarks</a> designed to evaluate the state of <a href="/facts/Automated_reasoning/x5EdkKoU">automated reasoning</a> (or mechanization) in the <a href="/facts/Metatheory/xqUcQD2m">metatheory</a> of programming languages, and to stimulate discussion and collaboration among a diverse cross section of the <a href="/facts/Formal_methods/tw4FCWIb">formal methods</a> community. Very loosely speaking, the challenge is about measurement of how well programs may be proven to match a specification of how they are intended to behave (and the many complex issues that this involves). The challenge was initially proposed by the members of the <i>PL club</i> at the <a href="/facts/University_of_Pennsylvania/LBBBULox">University of Pennsylvania</a>, in association with collaborators around the world. The <i>Workshop on Mechanized Metatheory</i> is the main meeting of researchers participating in the challenge. </p><p>The design of the POPLmark benchmark is guided by features common to reasoning about programming languages. The challenge problems do not require the formalisation of large programming languages, but they do require sophistication in reasoning about: </p> <a href="/facts/Name_binding/HbBx9mpM">Binding</a> Most programming languages have some form of binding, ranging in complexity from the simple binders of <a href="/facts/Simply_typed_lambda_calculus/5RQlXLjy">simply typed lambda calculus</a> to complex, potentially infinite binders needed in the treatment of <a href="/facts/Record_(computer_science)/1fvSgenB">record</a> <a href="/facts/Pattern_matching/CEwptMs9">patterns</a>. <a href="/facts/Mathematical_induction/KxAPqNrH">Induction</a> Properties such as <a href="/facts/Subject_reduction/WVeYtmVq">subject reduction</a> and <a href="/facts/Strong_normalisation/eV9G3veH">strong normalisation</a> often require complex induction arguments. Reuse Furthering collaboration being a key aim of the challenge, the solutions are expected to contain reusable components that would allow researchers to share language features and designs without requiring them to start from scratch every time.