17th Annual Symposium on Foundations of Computer Science (sfcs 1976) (1976)
Oct. 25, 1976 to Oct. 27, 1976
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/SFCS.1976.3
To each family C of interpretations corresponds an equivalence relation among program schemes, namely the equivalence of the program schemes for all interpretation of C. A family C is algebraic if any two programs are C-equivalent iff every partial finite computation of one of them is C-equivalent to some partial finite computation of the other. Our main theorem states that a family C is algebraic iff it is represented with respect to the equivalence of programs by a single interpretation (a C-Herbrand interpretation) which is algebraic (in Scott's sense, roughly speaking). We give examples of algebraic and non algebraic families.
B. Courcelle and M. Nivat, "Algebraic families of interpretations," 17th Annual Symposium on Foundations of Computer Science (sfcs 1976)(FOCS), vol. 00, no. , pp. 137-146, 1976.