Safe recursion revisited I: Categorical semantics for lower complexity

The objective of this paper is to prove that the initial Pola setting, with both inductive and coinductive data, is sound for polynomial size (PSIZE). Explicitly this means all programs written in Pola have their output size bounded by a polynomial in their input size. The paper describes the polari...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Theoretical computer science Jg. 515; S. 19 - 45
Hauptverfasser:	Burrell, Mike, Cockett, Robin, Redmond, Brian
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 02.01.2014
Schlagworte:	Categorical semantics Implicit computational complexity Safe recursion Categorical semantics Safe recursion Implicit computational complexity
ISSN:	0304-3975, 1879-2294
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!