Executing Higher Order Logic [chapter]

Stefan Berghofer, Tobias Nipkow
2002 Lecture Notes in Computer Science  
We report on the design of a prototyping component for the theorem prover Isabelle/HOL. Specifications consisting of datatypes, recursive functions and inductive definitions are compiled into a functional program. Functions and inductively defined relations can be mixed. Inductive definitions must be such that they can be executed in Prolog style but requiring only matching rather than unification. This restriction is enforced by a mode analysis. Tail recursive partial functions can be defined and executed with the help of a while combinator.
doi:10.1007/3-540-45842-5_2 fatcat:sjktt7lu2jbzfngiaq7va3jqxa