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)

Related topics

Related topics

18 relations
ATSAutomated reasoningCoq (software)Expression problem

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
Proof assistants and the programming languages that implement them need to deal with a range of linguistic expressions that… 
2013
2013
Towards Self-Verification of Isabelle ’ s Sledgehammer
This paper presents an Isabelle/HOL formalisation of recent research in automated reasoning: efficient encodings of sorts in… 
2011
2011
A Solution to the PoplMark Challenge Based on de Bruijn Indices
The PoplMark challenge proposes a set of benchmarks intended to assess the usability of proof assistants in the context of… 
Review
2010
Review
2010
Programming Inductive Proofs - A New Approach Based on Contextual Types
  • B. Pientka
  • Verification, Induction, Termination Analysis
  • 2010
  • Corpus ID: 12724948
In this paper, we present an overview to programming with proofs in the reasoning framework, Beluga. Beluga supports the… 
Review
2009
Review
2009
Formalizing Operational Semantic Specifications in Logic
2009
2009
Logic Colloquium 2006: Higher-order abstract syntax in type theory
We develop a general tool to formalize and reason about languages expressed using higher-order abstract syntax in a proof-tool… 
2009
2009
Formal SOS-Proofs for the Lambda-Calculus
2008
2008
프로그래밍 언어 메타이론의 정형화 및 변수 묶기
프로그래밍 언어의 구문 구조(syntax)와 메타이론을 정형화(formalization)하고 관련된 명세(specification)의 증명을 자동화(automatization… 
2006
2006
Machine Obstructed Proof How many months can it take to verify 30 assembly instructions
After years doing programming language theory without going near a proof assistant, I was finally convinced by the POPLmark ‘buzz… 
2006
2006
Soundness of the simply typed lambda calculus in ACL2
To make it practical to mechanize proofs in programming language metatheory, several capabilities are required of the theorem… 
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)