Equational logic of recursive program schemes

Authors:
John G. Mersch
Affiliations:
Department of Mathematics, Northwestern State University of Louisiana, Natchitoches, LA
Venue:
CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
Year:
2005

Citing 5
Cited 0

Parametric corecursion

Theoretical Computer Science
Algebraic Semantics

Algebraic Semantics
Recursion and corecursion have the same equational logic

Theoretical Computer Science - Category theory and computer science
Infinite trees and completely iterative theories: a coalgebraic view

Theoretical Computer Science
Equational logic of recursive program schemes

Equational logic of recursive program schemes

Quantified Score

Hi-index	0.00

Visualization

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.