Parallel graph rewriting on loosely coupled machine architectures

DOI10.1007/3-540-54317-1_104OpenAlexW1534969854MaRDI QIDQ5881294

M. J. Plasmeijer, Unnamed Author, Unnamed Author

Publication date: 9 March 2023

Published in: Conditional and Typed Rewriting Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-54317-1_104

zbMATH Keywords

normal formexpressive powerfunctional languagefunctional graphreduction order

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (1)

Extending graph rewriting with copying

Uses Software

• CLEAN

Cites Work

• The lambda calculus. Its syntax and semantics. Rev. ed.
• A set of postulates for the foundation of logic. II
• A General PASCAL Program for Map Overlay of Quadtrees and Related Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Parallel graph rewriting on loosely coupled machine architectures