Graph grammars and operational semantics
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3540387 (Why is no real title available?)
- scientific article; zbMATH DE number 3556036 (Why is no real title available?)
- scientific article; zbMATH DE number 3574993 (Why is no real title available?)
- scientific article; zbMATH DE number 3633737 (Why is no real title available?)
- scientific article; zbMATH DE number 3379785 (Why is no real title available?)
- Abstract data types and software validation
- Algebraic specification of data types: A synthetic approach
- Can programming be liberated from the von Neumann style?
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- Data Types as Lattices
- Infinite trees in normal form and recursive equations having a unique solution
- Initial Algebra Semantics and Continuous Algebras
- Operational and Semantic Equivalence Between Recursive Programs
- Parallelism and concurrency of graph manipulations
- The Mathematics of Record Handling
- Tree-Manipulating Systems and Church-Rosser Theorems
- Varieties of chain-complete algebras
- Varieties of ordered algebras
Cited in
(2)
This page was built for publication: Graph grammars and operational semantics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1165029)