Let's see how things unfold.: reconciling the infinite with the intensional (extended abstract)

McBride, C.; Kurz, A, and Lenisa, M. and Tarlecki, A., eds. (2009) Let's see how things unfold.: reconciling the infinite with the intensional (extended abstract). In: Algebra and Coalgebra in Computer Science. Lecture Notes in Computer Science (5728). Springer, pp. 113-126. ISBN 978-3-642-03740-5

Full text not available in this repository.Request a copy

Abstract

Coinductive types model infinite structures unfolded on demand, like politicians' excuses: for each attack, there is a defence but no likelihood of resolution. Representing such evolving processes coinductively is often more attractive than representing them as functions from a set of permitted observations, such as projections or finite approximants, as it can be tricky to ensure that observations are meaningful and consistent. As programmers and reasoners, we need coinductive definitions in our toolbox, equipped with appropriate computational and logical machinery.

ORCID iDs

McBride, C. ORCID logoORCID: https://orcid.org/0000-0003-1487-0886; Kurz, A,, Lenisa, M. and Tarlecki, A.
CORE (COnnecting REpositories)