Formalising FinFuns – Generating Code for Functions as Data from Isabelle/HOL
From MaRDI portal
Publication:3183537
DOI10.1007/978-3-642-03359-9_22zbMath1252.68260MaRDI QIDQ3183537
Publication date: 20 October 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-03359-9_22
Related Items
FinFuns, A mechanised proof of Gödel's incompleteness theorems using Nominal Isabelle, A verified algorithm enumerating event structures, Animating the Formalised Semantics of a Java-Like Language
Uses Software
Cites Work