(Enter summary)
Abstract: This paper gives a treatment of substitution for "parametric" objects in final coalgebras,
and also presents principles of definition by corecursion for such objects. The substitution
results are coalgebraic versions of well-known consequences of initiality, and the work on
corecursion is a general formulation which allows one to specify elements of final coalgebras
using systems of equations. One source of our results is the theory of hypersets, and at the
end of this paper we sketch a... (Update)
Cited by: More
Recursive Coalgebras from Comonads - Capretta, Uustalu (2004)
(Correct)
Relating Two Approaches to Coinductive Solution of Recursive.. - Jacobs (2004)
(Correct)
Coproducts Of Ideal Monads - Ghani, Uustalu
(Correct)
Active bibliography (related documents): More All
0.3: On the Equational Definition of the Least Prefixed Point - Santocanale (2003)
(Correct)
0.3: Böhm's Theorem for Berarducci Trees - Dezani-Ciancaglini, Severi, de Vries (2000)
(Correct)
0.3: Bisimulations and Predicate Logic - Fernando (1994)
(Correct)
Similar documents based on text: More All
0.5: A Thesis Proposal on Final Coalgebras - Hughes (1998)
(Correct)
0.4: On the Foundations of Corecursion - Moss, DANNER (1997)
(Correct)
0.4: From Set-theoretic Coinduction to Coalgebraic Coinduction: some.. - Lenisa (1999)
(Correct)
Related documents from co-citation: More All
4: Infinite trees and completely iterative theories: a coalgebraic view (context) - Aczel, Adamek et al. - 2003
3: Free iterative theories: a coalgebraic view (context) - Adamek, Milius et al. - 2001
2: Substitution in non-wellfounded syntax with variable binding
- Matthes, Uustalu - 2003
BibTeX entry: (Update)
Lawrence S. Moss, "Parametric corecursion," to appear in Theoretical Computer Science. http://citeseer.ist.psu.edu/407952.html More
@article{ moss01parametric,
author = "Lawrence S. Moss",
title = "Parametric corecursion",
journal = "Theoretical Computer Science",
volume = "260",
number = "1--2",
pages = "139--163",
year = "2001",
url = "citeseer.ist.psu.edu/407952.html" }
Citations (may not include all citations):
186
Universal coalgebra: a theory of systems
- Rutten - 1999
67
Towards a Mathematical Operational Semantics
- Turi, Plotkin - 1997
37
The Liar: An Essay in Truth and Circularity (context) - Barwise, Etchemendy - 1987
30
Functorial Operational Semantics and its Denotational Dual (context) - Turi - 1996
18
Iteration Theories: The equational logic of iterative proces.. (context) - Bloom, 'Esik - 1993
8
The Logic of Recursive Equations
- Hurkens, McArthur et al. - 1998
4
Guarded Induction on Final Coalgebras (context) - Pavlovi'c - 1998
3
CSLI Lecture Notes Number (context) - Barwise, Moss et al. - 1996
3
Recursion and Corecursion have the Same Equational Logic
- Moss
3
CSLI Lecture Notes Number (context) - Aczel, Sets - 1988
1
the foundations of final semantics: nonstandard sets, metric..
- Turi, Rutten - 1998
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.math.indiana.edu/home/moss/articles.html): More
Recursion and Corecursion Have the Same Equational Logic - Moss
(Correct)
Modal Logic and Algebraic Specifications - Moss, Thatte
(Correct)
Coalgebraic Logic - Moss (1999)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC