Since 2014
Non-primitive Recursive Function Definitions
BRICS Report Series
View Archive Info| Field | Value | |
| Title |
Non-primitive Recursive Function Definitions
|
|
| Creator |
Agerholm, Sten
|
|
| Description |
This paper presents an approach to the problem of introducingnon-primitive recursive function definitions in higher order logic. Arecursive specification is translated into a domain theory version, wherethe recursive calls are treated as potentially non-terminating. Once wehave proved termination, the original specification can be derived easily.A collection of algorithms are presented which hide the domain theoryfrom a user. Hence, the derivation of a domain theory specificationhas been automated completely, and for well-founded recursive functionspecifications the process of deriving the original specification from thedomain theory one has been automated as well, though a user mustsupply a well-founded relation and prove certain termination propertiesof the specification. There are constructions for building well-foundedrelations easily.
|
|
| Publisher |
Aarhus University
|
|
| Contributor |
—
|
|
| Date |
1995-06-06
|
|
| Type |
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion — |
|
| Format |
application/pdf
|
|
| Identifier |
https://tidsskrift.dk/brics/article/view/19939
10.7146/brics.v2i36.19939 |
|
| Source |
BRICS Report Series; No 36 (1995): RS-36 Nonprimitive Recursive Function Definitions
BRICS Report Series; No 36 (1995): RS-36 Nonprimitive Recursive Function Definitions 1601-5355 0909-0878 |
|
| Language |
eng
|
|
| Relation |
https://tidsskrift.dk/brics/article/view/19939/17592
|
|
| Rights |
Copyright (c) 2015 BRICS Report Series
|
|