FinFuns

swMATH28536MaRDI QIDQ40250

No author found.

Described by source

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

Related Items (4)

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 ⋮ Animating the Formalised Semantics of a Java-Like Language

This page was built for software: FinFuns