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

Celý popis

Podrobná bibliografia

Vydané v:	Theoretical computer science Ročník 515; s. 19 - 45
Hlavní autori:	Burrell, Mike, Cockett, Robin, Redmond, Brian
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 02.01.2014
Predmet:	Categorical semantics Implicit computational complexity Safe recursion Categorical semantics Safe recursion Implicit computational complexity
ISSN:	0304-3975, 1879-2294
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!