Assertions and recursions

  • 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.

Download full text files

Export metadata

Statistics

Number of document requests

Additional Services

Share in Twitter Search Google Scholar
Metadaten
Author:Bernhard MöllerGND
URN:urn:nbn:de:bvb:384-opus4-235076
Frontdoor URLhttps://opus.bibliothek.uni-augsburg.de/opus4/23507
ISSN:0302-9743OPAC
Parent Title (English):Lecture Notes in Computer Science
Publisher:Springer
Type:Article
Language:English
Year of first Publication:1996
Publishing Institution:Universität Augsburg
Release Date:2017/07/21
Volume:1074
First Page:163
Last Page:184
Note:
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
DOI:https://doi.org/10.1007/3-540-61254-8_25
Institutes:Fakultät für Angewandte Informatik
Fakultät für Angewandte Informatik / Institut für Informatik
Fakultät für Angewandte Informatik / Institut für Informatik / Professur für Programmiermethodik und Multimediale Informationssysteme
Dewey Decimal Classification:5 Naturwissenschaften und Mathematik / 51 Mathematik / 510 Mathematik
Licence (German):Deutsches Urheberrecht