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

11 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

Machinery

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.
McBride, C. ; Kurz, A, (Editor) ; Lenisa, M. (Editor) ; Tarlecki, A. (Editor). / Let's see how things unfold.: reconciling the infinite with the intensional (extended abstract). Algebra and Coalgebra in Computer Science. 5728. ed. Springer, 2009. pp. 113-126 (Lecture Notes in Computer Science).
@inbook{de89e222434c4b05b0560a79acf0b2ce,
title = "Let's see how things unfold.: reconciling the infinite with the intensional (extended abstract)",
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.",
keywords = "information systems, information applications, theoretical computer science",
author = "C. McBride and A, Kurz and M. Lenisa and A. Tarlecki",
year = "2009",
month = "9",
language = "English",
isbn = "978-3-642-03740-5",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "113--126",
booktitle = "Algebra and Coalgebra in Computer Science",
edition = "5728",

}

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 edn, Lecture Notes in Computer Science, Springer, pp. 113-126.

Let's see how things unfold.: reconciling the infinite with the intensional (extended abstract). / McBride, C.; Kurz, A, (Editor); Lenisa, M. (Editor); Tarlecki, A. (Editor).

Algebra and Coalgebra in Computer Science. 5728. ed. Springer, 2009. p. 113-126 (Lecture Notes in Computer Science).

Research output: Chapter in Book/Report/Conference proceedingChapter

TY - CHAP

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

AU - McBride, C.

A2 - Kurz, A,

A2 - Lenisa, M.

A2 - Tarlecki, A.

PY - 2009/9

Y1 - 2009/9

N2 - 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.

AB - 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.

KW - information systems

KW - information applications

KW - theoretical computer science

UR - http://calco09.dimi.uniud.it/

UR - http://www.springer.com/computer/theoretical+computer+science/book/978-3-642-03740-5

M3 - Chapter

SN - 978-3-642-03740-5

T3 - Lecture Notes in Computer Science

SP - 113

EP - 126

BT - Algebra and Coalgebra in Computer Science

PB - Springer

ER -

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