Abstract:
. Algebraic structures which are generated by a collection of constructors--- like natural numbers (generated by a zero and a successor) or finite lists and trees--- are of well-established importance in computer science. Formally, they are initial algebras. Induction is used both as a definition principle, and as a proof principle for such structures. But there are also important dual "coalgebraic" structures, which do not come equipped with constructor operations but with what are sometimes called "destructor" operations (also called observers, accessors, transition maps, or mutators). Spaces of infinite data (including, for example, infinite lists, and non-well-founded sets) are generally of this kind. In general, dynamical systems with a hidden, black-box state space, to which a user only has limited access via specified (observer or mutator) operations, are coalgebras of various kinds. Such coalgebraic systems are common in computer science. And "coinduction" is the appropriate te...
Citations
|
870
|
The Lambda Calculus. Its Syntax and Semantics
– Barendregt
- 1984
|
|
446
|
Introduction to HOL: A Theorem Proving Environment for Higher Order Logic
– Gordon, Melham
- 1993
|
|
334
|
Category theory for computing science
– Barr, Wells
- 1990
|
|
246
|
An initial algebra approach to the specification, correctness, and implementation of abstract data types’, in: Current Trends in Programming Methodology, edited by R.T
– Goguen, Thatcher, et al.
|
|
165
|
Non-Well-Founded Sets
– Aczel
- 1988
|
|
134
|
A final coalgebra theorem
– Aczel, Mendler
- 1989
|
|
105
|
Fundamentals of Algebraic Specifications
– Ehrig, Mahr
- 1985
|
|
103
|
Terminal coalgebras in well-founded set theory
– Barr
- 1993
|
|
78
|
Towards an algebraic semantics for the object paradigm
– Goguen, Diaconescu
- 1993
|
|
64
|
Universal realization, persistent interconnection and implementation of abstract modules
– Goguen, Meseguer
- 1982
|
|
45
|
Solving reflexive domain equations in a category of complete metric spaces
– America, Rutten
- 1989
|
|
43
|
Structural induction and coinduction in a fibrational setting
– Hermida
|
|
40
|
Strong categorical datatypes I
– Cockett, Spencer
- 1992
|
|
39
|
A Coinduction Principle for Recursive Data Types Based
– Fiore
- 1996
|
|
39
|
A unifying type-theoretic framework for objects
– Hofmann, Pierce
- 1995
|
|
37
|
Control Flow Semantics
– Bakker
- 1996
|
|
31
|
Mongruences and cofree coalgebras
– Jacobs
- 1995
|
|
27
|
Proof of correctness of object representation
– Goguen, Malcolm
|
|
19
|
Parametrized data types do not need highly constrained parameters
– Arbib, Manes
- 1982
|
|
18
|
Hiding and behaviour: an institutional approach
– Burstall, Diaconescu
- 1994
|
|
17
|
Symbolic dynamics and finite automata
– BÉAL, PERRIN
- 1997
|
|
16
|
Strong categorical datatypes II: A term logic for categorical programming
– Cockett, Spencer
- 1992
|
|
16
|
Categories for Types. Cambridge Mathematical Textbooks
– Crole
- 1993
|
|
15
|
Arrows, structures, and functors: The categorical imperative
– Arbib, Manes
- 1975
|
|
12
|
Handbook of categorical algebra, volume 50–52 of Encyclopedia of Mathematics and its Applications
– Borceux
- 1994
|
|
11
|
Final semantics for untyped -calculus
– Honsell, Lenisa
- 1995
|
|
10
|
Observability concepts in abstract data specifications
– Giarrantana, Gimona, et al.
- 1976
|
|
10
|
An extended abstract of a hidden agenda
– Goguen, Malcolm
- 1996
|
|
9
|
Coalgebraic specifications and models of deterministic hybrid systems
– Jacobs
- 1996
|
|
8
|
An algebraic view of structural induction
– Hermida, Jacobs
- 1995
|
|
7
|
Parameters and Parametrization in Specification using distributive categories
– Jacobs
- 1995
|
|
5
|
Universal Algebra, volume 6 of Mathematics and its applications
– Cohn
- 1981
|
|
1
|
Algebra of Programmming
– Bird, Moor
- 1996
|
|
