scientific article; zbMATH DE number 969070

MaRDI QIDQ5284548zbMATH OpenFDO

Authors Erik Barendsen, Sjaak Smetsers

Publication date 22 May 1997

zbMATH Keywords

term graph rewritinggraph rewriting semantics

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

(17)

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

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)