×
Padawitz, Peter

Graph grammars and operational semantics. (English) Zbl 0486.68090

Theor. Comput. Sci. 19, 117-141 (1982).
Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page
scan of Zbl 0486.68090

Cited in 2 Documents

MSC:

68Q55 Semantics in the theory of computing
68Q45 Formal languages and automata
68Q60 Specification and verification (program logics, model checking, etc.)

Keywords:

programming language semantics; transformations of graphlike expressions; correctness of transformation rules; correctness of derivations; LISP interpreter; functional semantics

Citations:

Zbl 0406.68059
PDF BibTeX XML Cite
\textit{P. Padawitz}, Theor. Comput. Sci. 19, 117--141 (1982; Zbl 0486.68090)
Full Text: DOI

References:

[1] Goguen, J. A.; Thatcher, J. W.; Wagner, E. G.; Wright, J. B., Initial algebra semantics and continuous algebras, J. ACM, 1, 68-95 (1977) · Zbl 0359.68018
[2] Goguen, J. A.; Thatcher, J. W.; Wagner, E. G., An initial algebra approach to the specification, correctness and implementation of abstract data types, (Yeh, R., Current Trends in Programming Methodology, Vol. IV: Data Structuring (1978), Prentice-Hall: Prentice-Hall Englewood Cliffs, NJ), 80-144
[3] Thatcher, J. W.; Wagner, E. G.; Wright, J. B., Many-sorted and ordered algebraic theories, IBM Research Report RC 7595 (1979)
[4] Backus, J., Can programming be liberated from the von Neumann style?, Comm. ACM, 8, 613-641 (1978) · Zbl 0383.68013
[5] Bloom, S. L., Varieties of ordered algebras, J. Comput. System Sci., 13, 200-212 (1976) · Zbl 0337.06008
[6] Cadiou, J. M.; Manna, Z., Recursive definitions of partial functions and their computations, SIGPLAN Notices, 1, 58-65 (1972)
[7] Courcelle, B., Infinite trees in normal form and recursive equations having a unique solution, Math. Systems Theory, 13, 131-180 (1979) · Zbl 0418.68013
[8] Dittrich, G.; Merzenich, W., Ω-nets, (Merzenich, W., Proc. 1st Workshop-Meeting on Categorical and Algebraic Methods in ComputerScience and System Theory (1976), Universität Dortmund) · Zbl 0368.68062
[9] Dittrich, G.; Merzenich, W., Nets over many-sorted operator domains and their semantics, (Karpiński, M., Proc. International Conference on Fundamentals of Computation Theory 1977. Proc. International Conference on Fundamentals of Computation Theory 1977, Lecture Notes in Computer Science, 56 (1977), Springer: Springer Berlin), 240-244 · Zbl 0368.68062
[10] Ehrig, H., Introduction to the algebraic theory of graph grammars, (Claus, V.; Ehrig, H.; Rozenberg, G., Proc. International Workshop on Graph Grammars and their Applications to Computer Science and Biology. Proc. International Workshop on Graph Grammars and their Applications to Computer Science and Biology, Lecture Notes in Computer Science, 73 (1979), Springer: Springer Berlin), 1-69
[11] Ehrig, H.; Rosen, B. K., Commutativity of independent transformations of complex objects, IBM Research Report RC 6251 (1976) · Zbl 0357.02034
[12] Ehrig, H.; Rosen, B. K., The mathematics of record handling, SIAM J. Comput., 9, 441-469 (1980) · Zbl 0455.68021
[13] Ehrig, H.; Rosen, B. K., Parallelism and concurrency of graph manipulations, Theoret. Comput. Sci., 11, 247-275 (1980) · Zbl 0449.68036
[14] Guttag, J. V.; Horowitz, E.; Musser, D. R., Abstract data types and software validation, Comm. ACM, 12, 1048-1063 (1978) · Zbl 0387.68012
[15] Henderson, P.; Morris, J., A lazy evaluator, Proc. 3rd ACM Symposium on Principles of Programming Languages, 95-103 (1976)
[16] Huet, G., Confluent reductions: Abstract properties and applications to term rewriting systems, J. ACM, 27, 797-821 (1980) · Zbl 0458.68007
[17] Lehmann, D. J.; Smyth, M., Algebraic specification of data types—a synthetic approach, Math. Systems Theory, 14, 97-139 (1981) · Zbl 0457.68035
[18] Meseguer, J., Varieties of chain-complete algebras, J. Pure Appl. Algebra, 19, 347-383 (1980) · Zbl 0445.18008
[19] Nivat, M., On the interpretation of recursive polyadic program schemes, (Symposia Mathematica, 15 (1975), Academic Press: Academic Press New York), 255-281
[20] Padawitz, P., Operationelle und funktionale Semantik von Σ-Graphen mit Anwendungen auf LISP, (Fachbereich 20 (1978), Technische Universität Berlin), Bericht Nr. 78-23
[21] Raoult, J.-C.; Vuillemin, J., Operational and semantic equivalence between recursive programs, J. ACM, 27, 772-796 (1980) · Zbl 0447.68004
[22] Rosen, B. K., Tree-manipulating systems and Church-Rosser theorems, J. ACM, 1, 160-187 (1973) · Zbl 0267.68013
[23] Scott, D. S., Continuous lattices, (Lawvere, F. W., Toposes, Algebraic Geometry and Logic, 274 (1972), Springer: Springer Berlin), 97-136, Lecture Notes in Mathematics
[24] Scott, D. S., Data types as lattices, SIAM J. Comput., 5, 522-587 (1976) · Zbl 0337.02018
[25] Vuillemin, J., Correct and optimal implementations of recursion in a simple programming language, J. Comput. System Sci., 9, 332-354 (1974)
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.