Code Generation for Functions as Data

Andreas Lochbihler 🌐

May 6, 2009

This is a development version of this entry. It might change over time and is not stable. Please refer to release versions for citations.

Abstract

FinFuns are total functions that are constant except for a finite set of points, i.e. a generalisation of finite maps. They are formalised as a new type in Isabelle/HOL such that the code generator can handle equality tests and quantification on FinFuns. On the code output level, FinFuns are explicitly represented by constant functions and pointwise updates, similarly to associative lists. Inside the logic, they behave like ordinary functions with extensionality. Via the update/constant pattern, a recursion combinator and an induction rule for FinFuns allow for defining and reasoning about operators on FinFun that are also executable.
BSD License

Topics

Theories of FinFun