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

Full description

Bibliographic Details

Published in:	Theoretical computer science Vol. 515; pp. 19 - 45
Main Authors:	Burrell, Mike, Cockett, Robin, Redmond, Brian
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 02.01.2014
Subjects:	Categorical semantics Implicit computational complexity Safe recursion Categorical semantics Safe recursion Implicit computational complexity
ISSN:	0304-3975, 1879-2294
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!