×

On some classes of interpretations. (English) Zbl 0392.68009


MSC:

68Q60 Specification and verification (program logics, model checking, etc.)
68Q65 Abstract data types; algebraic specification

Software:

LCF
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Ashcroft, E.; Manna, Z.; Pnueli, A., Decidable properties of monadic functional schemas, J. Assoc. Comput. Mach., 20, 489-499 (1973) · Zbl 0289.68036
[2] Bell, J.; Slomson, A., Models and Ultraproducts (1971), North-Holland: North-Holland London · Zbl 0179.31402
[3] Berry, G.; Courcelle, B., Program equivalence and canonical forms in stable discrete interpretations, (Proceedings, 3rd Colloquium on Automata, Languages and Programming. Proceedings, 3rd Colloquium on Automata, Languages and Programming, Edinburgh (1976)), 168-188 · Zbl 0363.68036
[4] Birkhoff, G., Lattice Theory (1967), Amer. Math. Soc.,: Amer. Math. Soc., Providence, R.I · Zbl 0126.03801
[5] R. BurstallComput. J.12; R. BurstallComput. J.12 · Zbl 0164.46202
[6] Burstall, R.; Darlington, J., A system which automatically improves programs, (Proceedings 3rd IJCAI, S.R.I. (1973)), 537-542 · Zbl 0395.68017
[7] Chandra, A., Generalized program schemas, SIAM J. Comput., 5, 402-413 (1976) · Zbl 0382.68018
[8] Courcelle, B., A representation of trees by languages, Parts I and II, Theor. Comput. Sci., 7, 25-55 (1978) · Zbl 0428.68088
[9] Courcelle, B., On the definition of classes of interpretations, (4th ICALP. 4th ICALP, Turku. 4th ICALP. 4th ICALP, Turku, Lecture Notes in Computer Science, Vol. 52 (July 1977), Springer-Verlag: Springer-Verlag New York/Berlin) · Zbl 0355.68021
[10] Courcelle, B.; Nivat, M., The algebraic semantics of recursive program schemes, (Communication to the Colloquium on Mathematical Foundations of Computer Science. Communication to the Colloquium on Mathematical Foundations of Computer Science, Zakopane, Poland. Communication to the Colloquium on Mathematical Foundations of Computer Science. Communication to the Colloquium on Mathematical Foundations of Computer Science, Zakopane, Poland, Lecture Notes in Computer Science, Vol. 64 (1978), Springer-Verlag: Springer-Verlag New York) · Zbl 0384.68016
[11] Courcelle, B.; Nivat, M., Algebraic families of interpretations, (Proceedings, 17th Symposium on F.O.C.S.. Proceedings, 17th Symposium on F.O.C.S., Houston (1976)), (also available as Laboria Report No. 189) · Zbl 0384.68016
[12] Guessarian, I., Semantic equivalence of program schemes, (Proceedings, 3rd Colloquium on Automata, Languages and Programming. Proceedings, 3rd Colloquium on Automata, Languages and Programming, Edinburgh (1976)), 189-200 · Zbl 0364.68019
[13] Guessarian, I., Equivalences Sémantiques et classes d’interprétations, Doctoral Dissertation, (1975), Paris
[14] Milner, R., Models of LCF, Memo, Stanford AIM-184 (1973) · Zbl 0364.02018
[15] Morris, J. H., Another recursion induction principle, Comm. ACM, 14, No. 5 (1971) · Zbl 0226.68026
[16] Nivat, M., On the interpretation of polyadic recursive schemes, (Symposia Mathematica, Vol. 15 (1975), Academic Press: Academic Press New York) · Zbl 0346.68041
[17] Park, D., Finiteness is μ-ineffable, Theor. Comput. Sci., 3, 173-181 (1976) · Zbl 0353.02027
[18] Schoenfield, J. R., Mathematical Logic (1967), Addison-Wesley: Addison-Wesley Reading, Mass · Zbl 0155.01102
[19] ADJ, Initial Algebra Semantics and Continuous Algebras, J. Assoc. Comput. Mach., 24, 68-95 (1977) · Zbl 0359.68018
[20] Markowsky, G.; Rosen, B., Bases for Chain-complete posets, IBM J. Res. Dev., 20, 138-147 (1976) · Zbl 0329.06001
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.