LEAN: An intermediate language based on graph rewriting

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

H. P. Barendregt, J. R. Kennaway, M. R. Sleep, M. C. J. D. van Eekelen, M. J. Plasmeijer, 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

68Q65: Abstract data types; algebraic specification

68N01: General topics in the theory of software

68N99: Theory of software

03D03: Thue and Post systems, etc.

Related Items

Rewriting on cyclic structures: Equivalence between the operational and the categorical description, On the complexity of deduction modulo leaf permutative equations, 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, An operational semantics for paragon: A design notation for parallel architectures, Implementing term rewrite languages in DACTL, On ``On graph rewritings, Term graph rewriting and garbage collection using opfibrations, Transitive term graph rewriting, Normalization results for typeable rewrite systems, Lambda calculus with explicit recursion, Computing in unpredictable environments: semantics, reduction strategies, and program transformations, Generating irregular partitionable data structures, A uniform framework for term and graph rewriting applied to combined systems, Dynamic connectors for concurrency, Normal forms for algebras of connections., Context-sensitive rewriting strategies, Relating graph and term rewriting via Böhm models, A general framework for types in graph rewriting, Sharing in the Graph Rewriting Calculus, Three Syntactic Theories for Combinatory Graph Reduction, On GS-Monoidal Theories for Graphs with Nesting, A Rewriting Logic Approach to Type Inference