- is the
mathematical dual to
structural induction.[citation needed]
Coinductively defined data
types are
known as
codata and are
typically infinite data...
- A
coinductive data
definition is one that
specifies the
operations that may be
performed on a
piece of data; typically, self-referential
coinductive definitions...
- can be
stated more
formally in
category theory: the
anamorphism of a
coinductive type
denotes the ****ignment of a
coalgebra to its
unique morphism to...
- programming, a
stream is a
potentially infinite analog of a list,
given by the
coinductive definition: data
Stream α = Nil | Cons α (Stream α)
Generating and computing...
-
greatest fixed point and
terminal F-coalgebra, with
applications to
coinductive types.
These can be used for
allowing potentially infinite objects while...
- doi:10.1007/978-3-319-10542-0.
Retrieved Mar 13, 2024.
Xavier Leroy. "
Coinductive big-step
operational semantics".
Gilles Kahn. "Natural Semantics". Proceedings...
-
inductive data type, an
apomorphism models primitive corecursion over a
coinductive data type. The term "apomorphism" was
introduced in
Functional Programming...
- (propositional equality). M-types are dual to W-types, they
represent coinductive (potentially infinite) data such as streams. M-types can be
derived from...
- the type of well-founded trees.
Later work in type
theory generated coinductive types, induction-recursion, and induction-induction for
working on types...
-
normalizing Charity programming language (i.e. each
program terminates in it),
coinductive data
types can be used to
achieve surprising results,
enabling the definition...
