Abstract
In this paper we present FLRS, a sound and complete equational logic for proving the equivalence of recursive program schemes. We use extended versions of the Solution Theorems from [1] and [2] to provide coalgebraic semantics to recursive program schemes. We end the paper with a proof that FLRS is complete with respect to the coalgebraic semantics.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aczel, P., Adámek, J., Milius, S., Velebil, J.: Infinite trees and completely iterative theories: A coalgebraic view. Theoretical Computer Science 300, 1–45 (2003)
Milius, S., Moss, L.S.: The category theoretic solution of recursive program schemes (2004), preprint available at http://www.iti.cs.tu-bs.de/~milius/
Guessarian, I.: Algebraic Semantics. LNCS, vol. 99. Springer, Heidelberg (1981)
Courcelle, B.: Fundamental properties of infinite trees. Theoretical Computer Science 25, 95–169 (1983)
Moss, L.S.: Recursion and corecursion have the same equational logic. Theoretical Computer Science 294, 233–267 (2003)
Hurkens, A.J.C., McArthur, M., Moschovakis, Y.N., Moss, L.S., Whitney, G.T.: The logic of recursive equations. The Journal of Symbolic Logic 63, 451–478 (1998)
Moschovakis, Y.N.: The formal language of recursion. The Journal of Symbolic Logic 54, 1216–1252 (1989)
Mersch, J.G.: Equational Logic of Recursive Program Schemes. PhD thesis, Indiana University (2004)
Moss, L.S.: Parametric corecursion. Theoretical Computer Science 260, 139–163 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mersch, J.G. (2005). Equational Logic of Recursive Program Schemes. In: Fiadeiro, J.L., Harman, N., Roggenbach, M., Rutten, J. (eds) Algebra and Coalgebra in Computer Science. CALCO 2005. Lecture Notes in Computer Science, vol 3629. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11548133_18
Download citation
DOI: https://doi.org/10.1007/11548133_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28620-2
Online ISBN: 978-3-540-31876-7
eBook Packages: Computer ScienceComputer Science (R0)