scientific article; zbMATH DE number 108369
From MaRDI portal
Publication:4023829
Recommendations
Cited in
(46)- Categorical rewriting of term-like structures
- An Ontology of States
- Termination of Priority Rewriting
- Singular and plural functions for functional logic programming
- Parallel rewriting of attributed graphs
- Functional programming framework for \textit{GRworkbench}
- The narrowing-driven approach to functional logic program specialization
- Rewriting on cyclic structures: Equivalence between the operational and the categorical description
- scientific article; zbMATH DE number 4043221 (Why is no real title available?)
- A term-graph clausal logic: completeness and incompleteness results ★
- The Impact of the Lambda Calculus in Logic and Computer Science
- Rewriting strategies and strategic rewrite programs
- Sharing in the graph rewriting calculus
- Concrete data structures and functional parallel programming
- Trends in trends in functional programming 1999/2000 versus 2007/2008
- Semantics and strong sequentially of priority term rewriting systems
- Models of the lambda calculus: an introduction
- Semantics and strong sequentiality of priority term rewriting systems
- Distributed computation by graph reduction
- A compact fixpoint semantics for term rewriting systems
- Parallel graph rewriting on loosely coupled machine architectures
- Strong and NV-sequentiality of constructor systems
- scientific article; zbMATH DE number 1393310 (Why is no real title available?)
- Tree representations of the quiver \(\widetilde{\mathbb{E}}_6\)
- On modularity in infinitary term rewriting
- scientific article; zbMATH DE number 4030948 (Why is no real title available?)
- From functional programs to interaction nets via the rewriting calculus
- Termination of lazy rewriting revisited
- Strategic port graph rewriting: an interactive modelling framework
- Recursive Functions with Pattern Matching in Interaction Nets
- On term-graph rewrite strategies
- Tree representations of the quiver \(\widetilde{\mathbb{D}}_m \)
- Three Syntactic Theories for Combinatory Graph Reduction
- Abstract λ-Calculus Machines
- Relating graph and term rewriting via Böhm models
- Functional programming with graphs
- From Outermost Termination to Innermost Termination
- Lazy rewriting and eager machinery
- Context-sensitive rewriting strategies
- An Introduction to the Lambda Calculus
- From Interpretation to Compilation
- Proving Properties of Lazy Functional Programs with Sparkle
- scientific article; zbMATH DE number 194911 (Why is no real title available?)
- Parallel coherent graph transformations
- Convergence in infinitary term graph rewriting systems is simple
- On graph rewriting, reduction, and evaluation in the presence of cycles
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 Q4023829)
