Treffer: Equational logic of recursive program schemes
Title:
Equational logic of recursive program schemes
Authors:
Source:
Algebra and coalgebra in computer science (Swansea, 3-6 September 2005)Lecture notes in computer science. :278-292
Publisher Information:
Berlin: Springer, 2005.
Publication Year:
2005
Physical Description:
print, 9 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Théorie programmation, Programming theory, Algèbre processus, Process algebra, Algebra proceso, Coalgèbre, Coalgebra, Programme récursif, Recursive program, Programa recursivo, Sémantique algébrique, Algebraic semantic, Semántica algebraica
Document Type:
Konferenz
Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Department of Mathematics, Northwestern State University of Louisiana, Natchitoches LA 71497, United States
ISSN:
0302-9743
Rights:
Copyright 2005 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.17116024
Database:
PASCAL Archive
Weitere Informationen
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.