Abstract
This is a survey of general properties of recursive program schemes and classes of interpretations.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
ADJ, Initial algebra semantics and continuous algebras, JACM 24 (1977) 68–95.
G. Birkoff, Lattice Theory, AMS (1967).
S. Bloom, Varieties of ordered algebras, JCSS 13 (1976), pp 200–212.
R. Burstall, Proving properties of programs by Structural induction, Comp. Journal 12 (1969) 41–48.
R. Burstall, J. Darlington, A transformation system for developping programs, JACM 24 (1977) 44–67.
B. Courcelle, A representation of trees by languages, to appear in TCS (1978).
B. Courcelle, On the definition of classes of interpretations, 4th ICALP Turku (1977) Lec, notes in Comp. Sc. Vol. 52. (Springer Verlag).
B. Courcelle, On recursive equations having a unique solution, Laboria report 285.
B. Courcelle, M. Nivat, Algebraic families of interpretations, 17th Symposium on F.O.C.S (Houston 1976) and Laboria report 189.
B. Courcelle, I Guessarian, On some classes of interpretations, to appear in J.C.S.S. (and Laboria report 253).
B. Courcelle, M. Nivat, in preparation.
B. Courcelle, J.C. Raoult, Completions of ordered magmas, to appear in Fundamenta Informaticae.
J. Darlington, R. Burstall, A system which automatically improves programs, 3rd IJCAI, SRI (1973) 537–542.
J. De Bakker, Recursive Procedures, Mathematical center Tract 24, Amsterdam 1971.
J. De Bakker, W.P. De Roewer, A calculus for recursive program schemes in Automata, Languages, Programing, (Nivat ed.) North-Holland, Amsterdam 1972.
G. Huet, B. Lang, Proving and applying program transformations expressed with 2nd order patterms, to appear in Acta Informatica (Laboria report 266).
Z. Manna, J. Vuillemin, Fixpoint approach to the Theory of Computation, CACM 15 (1972), pp 528–536.
G. Markowsky, B. Rosen, Bases for Chain-complete posets, IBM Jour. of Res. and Dev. vol. 20 (1976) pp 138–147.
J. McCarthy, A basis for a mathematical theory of computation in Computer programing and Formal systems, Braffort and Hirshberg ed., North-Holland, Amsterdam (1963).
J. Messeguer, On order Complete Universal Algebra and Enriched Functorial Semantics, FCT 77 (Poznan), Lecture Notes in Computer Sciences, Springer-Verlag
J. Mezei, J.B. Wright, Algebraic automata and context-free sets, Inf. and Control 11 (1967) pp 3–29.
R. Milner, Fully abstract models of typed λ-calculi, TCS 4 (1977) 1–22.
J.H. Morris, Another Recursion Induction Principle, CACM Vol. 14, no 5 (1971).
M. Nivat, On the interpretation of polyadic recursive schemes, Symposia Mathematica, vol. 15, Academic Press (1975).
J.W. Thatcher, E.G. Wagner, J.B. Wright, A uniform approach to inductive posets and inductive closure, to appear in T.C.S.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1978 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Courcelle, B., Nivat, M. (1978). The algebraic semantics of recursive program schemes. 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_53
Download citation
DOI: https://doi.org/10.1007/3-540-08921-7_53
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