scientific article
From MaRDI portal
Publication:4023829
zbMath0788.68023MaRDI QIDQ4023829
R. Plasmeijer, Marko van Eekelen
Publication date: 23 January 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Theory of programming languages (68N15) Grammars and rewriting systems (68Q42)
Related Items
Sharing in the Graph Rewriting Calculus ⋮ Lazy rewriting and eager machinery ⋮ Semantics and strong sequentially of priority term rewriting systems ⋮ Relating graph and term rewriting via Böhm models ⋮ Rewriting Strategies and Strategic Rewrite Programs ⋮ Convergence in infinitary term graph rewriting systems is simple ⋮ Trends in trends in functional programming 1999/2000 versus 2007/2008 ⋮ Unnamed Item ⋮ Parallel rewriting of attributed graphs ⋮ Strategic port graph rewriting: an interactive modelling framework ⋮ The Impact of the Lambda Calculus in Logic and Computer Science ⋮ Three Syntactic Theories for Combinatory Graph Reduction ⋮ Parallel coherent graph transformations ⋮ Singular and plural functions for functional logic programming ⋮ An Ontology of States ⋮ On graph rewriting, reduction, and evaluation in the presence of cycles ⋮ Recursive Functions with Pattern Matching in Interaction Nets ⋮ Categorical rewriting of term-like structures ⋮ On modularity in infinitary term rewriting ⋮ From Outermost Termination to Innermost Termination ⋮ Proving Properties of Lazy Functional Programs with Sparkle ⋮ An Introduction to the Lambda Calculus ⋮ Abstract λ-Calculus Machines ⋮ From Interpretation to Compilation ⋮ A compact fixpoint semantics for term rewriting systems ⋮ Rewriting on cyclic structures: Equivalence between the operational and the categorical description ⋮ The narrowing-driven approach to functional logic program specialization ⋮ Termination of Priority Rewriting ⋮ Semantics and strong sequentiality of priority term rewriting systems ⋮ A term-graph clausal logic: completeness and incompleteness results ★ ⋮ Strong and NV-sequentiality of constructor systems ⋮ Tree representations of the quiver $\widetilde{\mathbb{E}}_{6}$ ⋮ Context-sensitive rewriting strategies ⋮ 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}$
Uses Software
