scientific article; zbMATH DE number 919844
From MaRDI portal
Publication:4890709
Recommendations
Cited in
(40)- Applications of infinitary lambda calculus
- Orders, reduction graphs and spectra
- Lambda calculus with explicit recursion
- A uniform framework for term and graph rewriting applied to combined systems
- Type soundness for path polymorphism
- Skew confluence and the lambda calculus with letrec
- Normal forms for algebras of connections.
- Bisimilarity in term graph rewriting.
- Commutative rational term rewriting
- Drags: a compositional algebraic framework for graph rewriting
- Typed path polymorphism
- scientific article; zbMATH DE number 1722701 (Why is no real title available?)
- Modeling pointer redirection as cyclic term-graph rewriting
- Term-graph rewriting in \textsc{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
- Sharing in the graph rewriting calculus
- Three Syntactic Theories for Combinatory Graph Reduction
- The algebra of recursive graph transformation language UnCAL: complete axiomatisation and iteration categorical semantics
- Term-Graph Rewriting Via Explicit Paths
- A Finite Simulation Method in a Non-deterministic Call-by-Need Lambda-Calculus with Letrec, Constructors, and Case
- A Heterogeneous Pushout Approach to Term-Graph Transformation
- Initial Algebra Semantics for Cyclic Sharing Structures
- scientific article; zbMATH DE number 58292 (Why is no real title available?)
- An inside view of EXP; or, The closed fragment of the provability logic of IΔ0 + Ω1 with a prepositional constant for EXP
- scientific article; zbMATH DE number 1231589 (Why is no real title available?)
- Relational treatment of term graphs with bound variables
- Term graph rewriting
- A complete proof system for nested term graphs
- Categorical rewriting of term-like structures
- Rewriting on cyclic structures: Equivalence between the operational and the categorical description
- Term-graph anti-unification
- Parallel independence in attributed graph rewriting
- Patch graph rewriting
- A duality between proof systems for cyclic term graphs
- Clocks for Functional Programs
- Compiling collapsing rules in certain constructor systems
- A Coinductive Reformulation of Milner's Proof System for Regular Expressions Modulo Bisimilarity
- Infinite normal forms for non-linear term rewriting systems
- Productivity of stream definitions
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 Q4890709)
