@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 = sep,

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",

}