Skip to search formSkip to main contentSkip to account menu

POPLmark challenge

Known as: POPLmark 
In programming language theory, the POPLmark challenge (from "Principles of Programming Languages benchmark", formerly Mechanized Metatheory for the… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
This paper presents an Isabelle/HOL formalisation of recent research in automated reasoning: efficient encodings of sorts in… 
2012
2012
We present a solution to the PoplMark challenge designed by Aydemir et al., which has as a goal the formalization of the meta… 
Review
2010
Review
2010
  • B. Pientka
  • 2010
  • Corpus ID: 12724948
In this paper, we present an overview to programming with proofs in the reasoning framework, Beluga. Beluga supports the… 
2009
2009
We develop a general tool to formalize and reason about languages expressed using higher-order abstract syntax in a proof-tool… 
2008
2008
프로그래밍 언어의 구문 구조(syntax)와 메타이론을 정형화(formalization)하고 관련된 명세(specification)의 증명을 자동화(automatization… 
2006
2006
After years doing programming language theory without going near a proof assistant, I was finally convinced by the POPLmark ‘buzz… 
2006
2006
To make it practical to mechanize proofs in programming language metatheory, several capabilities are required of the theorem… 
2006
2006
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…