Abstract
A class C of interpretations is algebraic if, roughly speaking, for every two recursive program schemes ø and ø', the equivalence of ø and ø' with respect to C can be proved by an induction on the length of computation [9] if it holds. Classes of interpretations can be defined by logical, and/or order theoretical conditions. We examine several cases of algebraicity (for classes defined by first-order conditions) and non-algebraicity.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
E. Aschroft, Z. Manna, A. Pnueli, "Decidable properties of monadic functional schemas", JACM Vol. 20 (1973) pp. 489–499.
G. Berry, B. Courcelle, "Program Equivalence and Canonical forms in stable discrete interpretations", Proc. of 3rd colloqium on Automata, Languages and Programming, Edinburgh, (1976). pp. 168–188.
R. Burstall, "Proving properties of programs by structural induction", Comp. Journal (12) pp. 41–48.
R. Burstall, J. Darlington, "A system which automatically improves programs", Proc. of 3rd Int. joint conf. artif. intelligence, S.R.I. (1973) pp. 537–542.
B. Courcelle, M. Nivat, "Algebraic Families of interpretations", 17th symp. on F.O.C.S., Houston (1976) (also available as Laboria Report no 189).
S.A. Greibach, "Theory of program Structures: Schemes, Semantics, Verifications" Lecture Notes in Computer Science Vol 36 (1975) Springer Verlag.
I. Guessarian, "Semantic equivalence of program schemes", Proc. of 3rd coll. on Aut., Languages and Programming, Edinburgh (1976), pp. 189–200.
J. Kfoury, D. Park, "On termination of program schemas" Inf. and Control Vol 29 (1975) pp. 243–251.
R. Milner, "Models of LCF", Memo stanford. AIM-184 (1973).
J.H. Morris, "Another Recursion Induction Principle", CACM Vol 14, no5 (1971).
M. Nivat, "On the interpretation of polyadic recursive schemes", symp. Mathematica Vol 15, Academic Press (1975).
D. Park, "Finiteness is μ-ineffable", Report no3, Warwick University (1974).
J.R. Schoenfield, "Mathematical Logic", Addison-Wesley (1967).
B. Courcelle, I. Guessarian, M. Nivat, "The algebraic semantics of recursive program schemes", submitted for publication.
A. Chandra, "Generalized program schemas" SIAM J. on computing Vol 5 (1976) pp. 402–413.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1977 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Courcelle, B. (1977). On the definition of classes of interpretations. In: Salomaa, A., Steinby, M. (eds) Automata, Languages and Programming. ICALP 1977. Lecture Notes in Computer Science, vol 52. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08342-1_43
Download citation
DOI: https://doi.org/10.1007/3-540-08342-1_43
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08342-9
Online ISBN: 978-3-540-37305-6
eBook Packages: Springer Book Archive