Abstract
We prove that the algebraic semantics of program schemes — besides of providing an adequate semantics equivalent to the fixpoint one — applies very naturally to various domains such as proofs of program properties, simplifications of programs or more generally equivalences of programs and comparison of computation rules.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
A. AHO, J. ULLMAN, The theory of parsing, translation and compiling, Prentice Hall, London (1973)
A. ARNOLD, M. DAUCHET, Transductions de forêts reconnaissables monadiques, forêts corégulières, R.A.I.R.O., Vol. 10, no3 (1976), 5–28
G. BIRKHOFF, Lattice theory, AMS 3rd edition, New York (1967)
B. COURCELLE, I. GUESSARIAN, On some classes of interpretations, IRIA Report no253 (1977)
B. COURCELLE, I. GUESSARIAN, M. NIVAT, The algebraic semanties of recursive program schemes, in preparation
P. DOWNEY, R. SETHI, Correct computation rules for recursive languages, SIAM J. Comp., Vol.5,no3 (1976), 378–401
J. ENGELFRIET, Some remarks on classes of macro-languages, Coll. "Les arbres en algèbre et programmation", Lille Univ. (1976)
I. GUESSARIAN, Schémas récursifs polyadiques: équivalences et classe d'interprétations, Thèse d'Etat, Univ. PARIS 7, Paris (1975)
J. GOGUEN, J. THATCHER, E. WAGNER, J. WRIGHT, Some fundamentals of order-algebraic semantics, MFCS 76, Lecture Notes in Computer Science no45, A. Mazurkiewicz Ed., Springer-Verlag (1976), 153–168
I. IANOV, The logical schemes of algorithms, in problems of Cybernetics, Pergamon Press, London (1960), 82–140
K. INDERMARK, Schemes with recursion on higher types, MFCS 76, Lect. Notes in Comp. Sc. no45, A. Mazurkiewicz Ed., Springer-Verlag (1976), 352–358
R. MILNER, Models of LCF, Stanford A.I. Lab. Memo. AIM/CS 332, Stanford (1973)
J. MORRIS, Another recursion induction principle, Com. ACM, Vol. 14 (1971), 351–354
M. NIVAT, On the interpretation of recursive polyadic program schemes, Symposia Mathematica, Vol. 15, Rome (1975)
D. SCOTT, C. STRACHEY, Toward a mathematical semantics for computer languages, Technical Monograph PRG-6, Oxford Univ. (1971)
J. VUILLEMIN, Syntaxe, sémantique et axiomatique d'un langage de programmation simple, Thèse d'état, Paris (1974)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1978 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Guessarian, I. (1978). Some applications of algebraic semantics. In: Winkowski, J. (eds) Mathematical Foundations of Computer Science 1978. MFCS 1978. Lecture Notes in Computer Science, vol 64. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08921-7_73
Download citation
DOI: https://doi.org/10.1007/3-540-08921-7_73
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08921-6
Online ISBN: 978-3-540-35757-5
eBook Packages: Springer Book Archive