scientific article; zbMATH DE number 969070

zbMath0863.68081MaRDI QIDQ5284548

Sjaak Smetsers, Erik Barendsen

Publication date: 22 May 1997

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

term graph rewritinggraph rewriting semantics

Mathematics Subject Classification ID

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

Related Items (11)

Normalization results for typeable rewrite systems ⋮ Abstract categorical semantics for resourceful functional reactive programming ⋮ MONTE CARLO ALGORITHMS FOR ELLIPTIC DIFFERENTIAL EQUATIONS. DATA PARALLEL FUNCTIONAL APPROACH∗ ⋮ Modular, higher order cardinality analysis in theory and practice ⋮ Unnamed Item ⋮ Term graph rewriting ⋮ Derivation and inference of higher-order strictness types ⋮ Modelling Unique and Affine Typing Using Polymorphism ⋮ Modeling and Verifying Graph Transformations in Proof Assistants ⋮ Hierarchical graph transformation ⋮ \( \pi\) with leftovers: a mechanisation in Agda

This page was built for publication: