scientific article; zbMATH DE number 969070

MaRDI QIDQ5284548zbMATH OpenFDO

Authors Erik Barendsen, Sjaak Smetsers

Publication date 22 May 1997

zbMATH Keywords

graph rewriting semanticsterm graph rewriting

Mathematics Subject Classification ID

Theory of programming languages (68N15) Grammars and rewriting systems (68Q42) Semantics in the theory of computing (68Q55)

Recommendations

• Guaranteeing safe destructive updates through a type system with uniqueness information for graphs
• scientific article; zbMATH DE number 1086663
• scientific article; zbMATH DE number 1231477
• scientific article; zbMATH DE number 2080217

Cited in

(19)

• Normalization results for typeable rewrite systems
• Hierarchical graph transformation
• Derivation and inference of higher-order strictness types
• \( \pi\) with leftovers: a mechanisation in Agda
• Modeling and verifying graph transformations in proof assistants
• Abstract categorical semantics for resourceful functional reactive programming
• Uniqueness Typing Redefined
• scientific article; zbMATH DE number 3942987 (Why is no real title available?)
• scientific article; zbMATH DE number 1231477 (Why is no real title available?)
• scientific article; zbMATH DE number 1262795 (Why is no real title available?)
• scientific article; zbMATH DE number 1086663 (Why is no real title available?)
• Term graph rewriting
• MONTE CARLO ALGORITHMS FOR ELLIPTIC DIFFERENTIAL EQUATIONS. DATA PARALLEL FUNCTIONAL APPROACH∗
• Type classes for lightweight substructural types
• Guaranteeing safe destructive updates through a type system with uniqueness information for graphs
• Graphical and incremental type inference. A graph transformation approach
• Modular, higher order cardinality analysis in theory and practice
• Modelling unique and affine typing using polymorphism
• Simple type inference for term graph rewriting systems

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5284548)