Graph grammars and operational semantics

DOI10.1016/0304-3975(82)90056-1zbMath0486.68090OpenAlexW2000362838MaRDI QIDQ1165029

Peter Padawitz

Publication date: 1982

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(82)90056-1

zbMATH Keywords

programming language semanticsfunctional semanticscorrectness of derivationscorrectness of transformation rulesLISP interpretertransformations of graphlike expressions

Mathematics Subject Classification ID

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

Related Items (2)

Implementing term rewriting by jungle evaluation ⋮ Algebraic approach to single-pushout graph transformation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Varieties of chain-complete algebras
• Parallelism and concurrency of graph manipulations
• Varieties of ordered algebras
• Infinite trees in normal form and recursive equations having a unique solution
• Operational and Semantic Equivalence Between Recursive Programs
• The Mathematics of Record Handling
• Algebraic specification of data types: A synthetic approach
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• Data Types as Lattices
• Initial Algebra Semantics and Continuous Algebras
• Can programming be liberated from the von Neumann style?
• Abstract data types and software validation
• Tree-Manipulating Systems and Church-Rosser Theorems

This page was built for publication: Graph grammars and operational semantics