×

zbMATH — the first resource for mathematics

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
PDF BibTeX XML Cite
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 London · Zbl 0179.31402
[3] Berry, G.; Courcelle, B., Program equivalence and canonical forms in stable discrete interpretations, (), 168-188 · Zbl 0363.68036
[4] Birkhoff, G., Lattice theory, (1967), Amer. Math. Soc., Providence, R.I · Zbl 0126.03801
[5] {\scR. Burstall}, Proving properties of programs by structural induction, Comput. J.{\bf12}, 41-48. · Zbl 0164.46202
[6] Burstall, R.; Darlington, J., A system which automatically improves programs, (), 537-542 · Zbl 0395.68017
[7] Chandra, A., Generalized program schemas, SIAM J. comput., 5, 402-413, (1976) · Zbl 0382.68018
[8] Courcelle, B.; Courcelle, B., A representation of trees by languages, parts I and II, Theor. comput. sci., Theor. comput. sci., 7, 25-55, (1978) · Zbl 0428.68088
[9] Courcelle, B., On the definition of classes of interpretations, () · Zbl 0355.68021
[10] Courcelle, B.; Nivat, M., The algebraic semantics of recursive program schemes, () · Zbl 0384.68016
[11] Courcelle, B.; Nivat, M., Algebraic families of interpretations, (), (also available as Laboria Report No. 189) · Zbl 0384.68016
[12] Guessarian, I., Semantic equivalence of program schemes, (), 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, () · 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 Reading, Mass
[19] ADJ, Initial algebra semantics and continuous algebras, J. assoc. comput. Mach., 24, 68-95, (1977)
[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. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.