scientific article; zbMATH DE number 108369
From MaRDI portal
Publication:4023829
zbMATH Open0788.68023MaRDI QIDQ4023829FDOQ4023829
Authors: Rinus Plasmeijer, Marko van Eekelen 
Publication date: 23 January 1993
Title of this publication is not available (Why is that?)
Recommendations
Theory of programming languages (68N15) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Grammars and rewriting systems (68Q42)
Cited In (46)
- Singular and plural functions for functional logic programming
- Termination of Priority Rewriting
- The narrowing-driven approach to functional logic program specialization
- Parallel rewriting of attributed graphs
- Functional programming framework for \textit{GRworkbench}
- Rewriting on cyclic structures: Equivalence between the operational and the categorical description
- Title not available (Why is that?)
- The Impact of the Lambda Calculus in Logic and Computer Science
- A term-graph clausal logic: completeness and incompleteness results ★
- 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
- Distributed computation by graph reduction
- Semantics and strong sequentiality of priority term rewriting systems
- Parallel graph rewriting on loosely coupled machine architectures
- A compact fixpoint semantics for term rewriting systems
- Title not available (Why is that?)
- Strong and NV-sequentiality of constructor systems
- Tree representations of the quiver \(\widetilde{\mathbb{E}}_6\)
- On modularity in infinitary term rewriting
- Title not available (Why is that?)
- Strategic port graph rewriting: an interactive modelling framework
- Recursive Functions with Pattern Matching in Interaction Nets
- From functional programs to interaction nets via the rewriting calculus
- Termination of lazy rewriting revisited
- On term-graph rewrite strategies
- Tree representations of the quiver \(\widetilde{\mathbb{D}}_m \)
- Three Syntactic Theories for Combinatory Graph Reduction
- Abstract λ-Calculus Machines
- Functional programming with graphs
- Relating graph and term rewriting via Böhm models
- From Outermost Termination to Innermost Termination
- Lazy rewriting and eager machinery
- Context-sensitive rewriting strategies
- Title not available (Why is that?)
- An Introduction to the Lambda Calculus
- From Interpretation to Compilation
- Proving Properties of Lazy Functional Programs with Sparkle
- Convergence in infinitary term graph rewriting systems is simple
- Parallel coherent graph transformations
- Categorical rewriting of term-like structures
- An Ontology of States
- On graph rewriting, reduction, and evaluation in the presence of cycles
Uses Software
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)
