scientific article; zbMATH DE number 919844
From MaRDI portal
Publication:4890709
zbMath0854.68049MaRDI QIDQ4890709
Jan Willem Klop, Zena M. Ariola
Publication date: 25 August 1996
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (35)
Sharing in the Graph Rewriting Calculus ⋮ Productivity of stream definitions ⋮ An inside view of EXP; or, The closed fragment of the provability logic of IΔ0 + Ω1 with a prepositional constant for EXP ⋮ Lambda calculus with explicit recursion ⋮ Patch Graph Rewriting ⋮ Drags: a compositional algebraic framework for graph rewriting ⋮ Typed path polymorphism ⋮ A Coinductive Reformulation of Milner's Proof System for Regular Expressions Modulo Bisimilarity ⋮ Term-Graph Rewriting Via Explicit Paths ⋮ A Finite Simulation Method in a Non-deterministic Call-by-Need Lambda-Calculus with Letrec, Constructors, and Case ⋮ Unnamed Item ⋮ Term-Graph Anti-Unification ⋮ Commutative rational term rewriting ⋮ Three Syntactic Theories for Combinatory Graph Reduction ⋮ Infinite normal forms for non-linear term rewriting systems ⋮ Type soundness for path polymorphism ⋮ Term graph rewriting ⋮ A complete proof system for Nested Term Graphs ⋮ Clocks for Functional Programs ⋮ Categorical rewriting of term-like structures ⋮ Compiling Collapsing Rules in Certain Constructor Systems ⋮ Rewriting on cyclic structures: Equivalence between the operational and the categorical description ⋮ A Heterogeneous Pushout Approach to Term-Graph Transformation ⋮ Applications of infinitary lambda calculus ⋮ Initial Algebra Semantics for Cyclic Sharing Structures ⋮ Orders, reduction graphs and spectra ⋮ A uniform framework for term and graph rewriting applied to combined systems ⋮ Skew confluence and the lambda calculus with letrec ⋮ The algebra of recursive graph transformation language UnCAL: complete axiomatisation and iteration categorical semantics ⋮ Normal forms for algebras of connections. ⋮ Bisimilarity in term graph rewriting. ⋮ Modeling Pointer Redirection as Cyclic Term-graph Rewriting ⋮ Term-graph Rewriting in Tom Using Relative Positions ⋮ Towards a Sharing Strategy for the Graph Rewriting Calculus ⋮ Computational Soundness of a Call by Name Calculus of Recursively-scoped Records
This page was built for publication:
