LEAN: An intermediate language based on graph rewriting

DOI10.1016/0167-8191(89)90126-9zbMath0681.68037OpenAlexW2010642618MaRDI QIDQ1823673

M. C. J. D. van Eekelen, M. J. Plasmeijer, Hendrik Pieter Barendregt, M. R. Sleep, J. R. Kennaway, J. R. W. Glauert

Publication date: 1989

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2066/17257

zbMATH Keywords

functional programming computational models generalized graph rewriting LEAN Term Rewriting Systems

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65) General topics in the theory of software (68N01) Theory of software (68N99) Thue and Post systems, etc. (03D03)

Related Items

Term graph rewriting and garbage collection using opfibrations, Sharing in the Graph Rewriting Calculus, Root-neededness and approximations of neededness, Transitive term graph rewriting, On ``On graph rewritings, A Rewriting Logic Approach to Type Inference, Normalization results for typeable rewrite systems, Lambda calculus with explicit recursion, Relating graph and term rewriting via Böhm models, Computing in unpredictable environments: semantics, reduction strategies, and program transformations, Implementing term rewrite languages in DACTL, Three Syntactic Theories for Combinatory Graph Reduction, Locating the contractum in the double pushout approach, Properties of a first-order functional language with sharing, Modularity in noncopying term rewriting, Hyperedge replacement jungle rewriting for term-rewriting systems and logic programming, Compiling Collapsing Rules in Certain Constructor Systems, On the complexity of deduction modulo leaf permutative equations, Rewriting on cyclic structures: Equivalence between the operational and the categorical description, On GS-Monoidal Theories for Graphs with Nesting, An operational semantics for paragon: A design notation for parallel architectures, Labelled Graph Rewriting Meets Social Networks, Generating irregular partitionable data structures, Böhm Reduction in Infinitary Term Graph Rewriting Systems, A uniform framework for term and graph rewriting applied to combined systems, Normal forms for algebras of connections., Context-sensitive rewriting strategies, A general framework for types in graph rewriting, Dynamic connectors for concurrency, On Term-Graph Rewrite Strategies