30 search results - page 2 / 6 » Diagonal fixed points in algebraic recursion theory |
ICDE
2008
IEEE
14 years 9 months ago
2008
IEEE
ct The backbone of the XML data model, namely ordered, unranked trees, is inherently recursive and it is natural to equip the associated languages with constructs that can query su...
LICS
2000
IEEE
13 years 12 months ago
2000
IEEE
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 p...
LICS
1991
IEEE
13 years 11 months ago
1991
IEEE
We present an elementary axiomatisation of synthetic domain theory and show that it is sufficient to deduce the fixed point property and solve domain equations. Models of these a...
ACMMPC
2000
Springer
13 years 12 months ago
2000
Springer
Fixed point calculus is about the solution of recursive equations de˛ned by a monotonic endofunction on a partially ordered set. This tutorial presents the basic theory of ˛xed ...
ICFP
1996
ACM
13 years 11 months ago
1996
ACM
An extension of the simply-typed lambda calculus is presented which contains both well-structured inductive and coinductive types, and which also identifies a class of types for w...