@inproceedings{1dbe0072e46246e0a123fbdd0bd191b1,
title = "From chaos to undefinedness: A story about recursion as well as termination, underspecification, nondeterminism, fixpoints, metric treatment, and logical models",
abstract = "The semantic and logical treatment of recursion and of recursive definitions in computer science, in particular in requirements specification, in programming languages and related formalisms such as λ-calcuius or recursively defined functions is one of the key issues of the semantic theory of programming and programming languages. As it has been recognised already in the early days of the theory of programming there are several options to formalise and give a theory of the semantics of recursive function declarations. In different branches of computer science, logics, and mathematics various techniques for dealing with the semantics of recursion have been developed and established. We outline, compare, and shortly discuss advantages and disadvantages of these different possibilities, illustrate them by a simple running example, and relate these approaches.",
author = "Manfred Broy",
year = "2006",
doi = "10.1007/11780274_25",
language = "English",
isbn = "354035462X",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "476--496",
booktitle = "Algebra, Meaning, and Computation",
note = "Symposium on Algebra, Meaning, and Computation - Essays Dedicated to Joseph A Goguen on the Occasion of His 65th Birthday ; Conference date: 27-06-2006 Through 29-06-2006",
}