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

C. McBride, A, Kurz (Editor), M. Lenisa (Editor), A. Tarlecki (Editor)

Research output: Chapter in Book/Report/Conference proceedingChapter

12 Citations (Scopus)

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.
Original languageEnglish
Title of host publicationAlgebra and Coalgebra in Computer Science
PublisherSpringer
Pages113-126
Number of pages13
Edition5728
ISBN (Print)978-3-642-03740-5
Publication statusPublished - Sep 2009

Publication series

NameLecture Notes in Computer Science
PublisherSpringer

    Fingerprint

Keywords

  • information systems
  • information applications
  • theoretical computer science

Cite this

McBride, C., Kurz, A. (Ed.), Lenisa, M. (Ed.), & Tarlecki, A. (Ed.) (2009). Let's see how things unfold.: reconciling the infinite with the intensional (extended abstract). In Algebra and Coalgebra in Computer Science (5728 ed., pp. 113-126). (Lecture Notes in Computer Science). Springer.