FinFuns

swMATH28536MaRDI QIDQ40250FDOQ40250

Author name not available (Why is that?)

Described by source

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

Cited In (4)

• Animating the Formalised Semantics of a Java-Like Language
• A verified algorithm enumerating event structures
• A mechanised proof of Gödel's incompleteness theorems using Nominal Isabelle
• Light-Weight Containers for Isabelle: Efficient, Extensible, Nestable

This page was built for software: FinFuns