DocumentCode :
2221526
Title :
Complete axioms for categorical fixed-point operators
Author :
Simpson, Alex ; Plotkin, Gordon
Author_Institution :
Div. of Inf., Edinburgh Univ., UK
fYear :
2000
fDate :
2000
Firstpage :
30
Lastpage :
41
Abstract :
We give an axiomatic treatment of fixed-point operators in categories. A notion of iteration operator is defined embodying the equational properties of iteration theories. We prove a general completeness theorem for iteration operators, relying on a new, purely syntactic characterisation of the free iteration theory. We then show how iteration operators arise in axiomatic domain theory. One result derives them from the existence of sufficiently many bifree algebras (exploiting the universal property Freyd introduced in his notion of algebraic compactness). Another result shows that, in the presence of a parameterized natural numbers object and an equational lifting monad, any uniform fixed-point operator is necessarily an iteration operator
Keywords :
category theory; formal logic; axiomatic domain theory; bifree algebra; categorical fixed-point operators; complete axioms; completeness theorem; equational lifting monad; free iteration theory; iteration operator; parameterized natural numbers; syntactic characterisation; Equations; Informatics; National electric code;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Logic in Computer Science, 2000. Proceedings. 15th Annual IEEE Symposium on
Conference_Location :
Santa Barbara, CA
ISSN :
1043-6871
Print_ISBN :
0-7695-0725-5
Type :
conf
DOI :
10.1109/LICS.2000.855753
Filename :
855753
Link To Document :
بازگشت