A general framework for types in graph rewriting

DOI10.1007/s00236-005-0180-4zbMath1081.68040OpenAlexW2067566191MaRDI QIDQ2581012

Barbara König

Publication date: 10 January 2006

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-005-0180-4

zbMATH Keywords

\(\lambda\)-calculus\(\pi\)-calculus

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items

Graphical and incremental type inference. A graph transformation approach

Uses Software

• SLAM
• Bandera

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hyperedge replacement: grammars and languages
• Constructive versions of Tarski's fixed point theorems
• Closed action calculi
• Comparing logics for rewriting: Rewriting logic, action calculi and tile logic
• Analysing input/output-capabilities of mobile processes with a generic type system
• LEAN: An intermediate language based on graph rewriting
• Bigraphs and transitions
• Hypergraph construction and its application to the static analysis of concurrent systems
• Explicit State Model Checking for Graph Grammars
• Graph expressions and graph rewritings
• Handbook of Graph Grammars and Computing by Graph Transformation
• A generic type system for the Pi-calculus
• Abstract Interpretation Frameworks
• Foundations of Software Science and Computation Structures
• A Machine-Oriented Logic Based on the Resolution Principle