TY  - JOUR
A1  - Möller, Bernhard
T1  - Assertions and recursions
T2  - Lecture Notes in Computer Science
N2  - We provide an algebraic description of subtypes and the way they propagate through recursive functions. By abstracting from the concrete domain of functions or relations we obtain a framework which is independent of strict or non-strict, deterministic or non-deterministic semantics. Applications include efficiency increasing simplification of recursions as well as proofs about recursions by noetherian induction, such as termination proofs.
Y1  - 1996
UR  - https://opus.bibliothek.uni-augsburg.de/opus4/frontdoor/index/index/docId/23507
UR  - https://nbn-resolving.org/urn:nbn:de:bvb:384-opus4-235076
SN  - 0302-9743
N1  - Higher order algebra, logic, and term rewriting: second international workshop, HOA '95, Paderborn, Germany, September 21 - 22, 1995; selected papers : Higher-order algebra, logic, and term rewriting
VL  - 1074
SP  - 163
EP  - 184
PB  - Springer
ER  -