FinFuns

MaRDI QIDQ40250swMATHFDO

Official website https://www.isa-afp.org/entries/FinFun.html

Described by source

• Formalising FinFuns – Generating Code for Functions as Data from Isabelle/HOL

Cited in

(8)

• CoqJVM
• A verified algorithm enumerating event structures
• A mechanised proof of Gödel's incompleteness theorems using Nominal Isabelle
• Animating the formalised semantics of a Java-like language
• Jinja Threads
• Containers
• Datatype Order Generator
• Light-weight containers for Isabelle: efficient, extensible, nestable

This page was built for software: FinFuns