scientific article; zbMATH DE number 969070

zbMATH Open0863.68081MaRDI QIDQ5284548FDOQ5284548

Sjaak Smetsers, Erik Barendsen

Publication date: 22 May 1997

Title of this publication is not available (Why is that?)

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

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)

Cited In (15)

• Uniqueness Typing Redefined
• Title not available (Why is that?)
• \( \pi\) with leftovers: a mechanisation in Agda
• Title not available (Why is that?)
• Title not available (Why is that?)
• Modelling Unique and Affine Typing Using Polymorphism
• Abstract categorical semantics for resourceful functional reactive programming
• Hierarchical graph transformation
• Simple type inference for term graph rewriting systems
• Term graph rewriting
• Modeling and verifying graph transformations in proof assistants
• Derivation and inference of higher-order strictness types
• Modular, higher order cardinality analysis in theory and practice
• Normalization results for typeable rewrite systems
• MONTE CARLO ALGORITHMS FOR ELLIPTIC DIFFERENTIAL EQUATIONS. DATA PARALLEL FUNCTIONAL 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)