The following pages link to FinFuns (Q40250):
Displayed 4 items.
- A mechanised proof of Gödel's incompleteness theorems using Nominal Isabelle (Q286772) (← links)
- A verified algorithm enumerating event structures (Q2364684) (← links)
- Animating the Formalised Semantics of a Java-Like Language (Q3088008) (← links)
- Light-Weight Containers for Isabelle: Efficient, Extensible, Nestable (Q5327340) (← links)