@article{Agerholm_1995, title={Non-primitive Recursive Function Definitions}, volume={2}, url={https://tidsskrift.dk/brics/article/view/19939}, DOI={10.7146/brics.v2i36.19939}, abstractNote={This paper presents an approach to the problem of introducing<br />non-primitive recursive function definitions in higher order logic. A<br />recursive specification is translated into a domain theory version, where<br />the recursive calls are treated as potentially non-terminating. Once we<br />have proved termination, the original specification can be derived easily.<br />A collection of algorithms are presented which hide the domain theory<br />from a user. Hence, the derivation of a domain theory specification<br />has been automated completely, and for well-founded recursive function<br />specifications the process of deriving the original specification from the<br />domain theory one has been automated as well, though a user must<br />supply a well-founded relation and prove certain termination properties<br />of the specification. There are constructions for building well-founded<br />relations easily.}, number={36}, journal={BRICS Report Series}, author={Agerholm, Sten}, year={1995}, month={Jun.} }