Proof Pearl: De Bruijn Terms Really Do Work
From MaRDI portal
Publication:3523176
DOI10.1007/978-3-540-74591-4_16zbMath1144.68362OpenAlexW1776521695MaRDI QIDQ3523176
René Vestergaard, Michael Norrish
Publication date: 2 September 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1885/36129
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (7)
A mechanised proof of Gödel's incompleteness theorems using Nominal Isabelle ⋮ Formalizing adequacy: a case study for higher-order abstract syntax ⋮ A formalized general theory of syntax with bindings ⋮ Alpha equivalence equalities ⋮ A formalized general theory of syntax with bindings: extended version ⋮ Hard Life with Weak Binders ⋮ Mechanised Computability Theory
Uses Software
This page was built for publication: Proof Pearl: De Bruijn Terms Really Do Work
