LEAN: An intermediate language based on graph rewriting

DOI10.1016/0167-8191(89)90126-9MaRDI QIDQ1823673zbMATH OpenOpenAlexFDO

Authors Henk Barendregt, M. C. J. D. van Eekelen, M. J. Plasmeijer, J. R. W. Glauert, J. R. Kennaway, M. R. Sleep

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

computational modelsfunctional programminggeneralized graph rewritingLEANTerm Rewriting Systems

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4030948
• Formal specification of a graph rewriting system with environments
• A kernel language for programmed rewriting of (hyper)graphs
• scientific article; zbMATH DE number 1086663
• A strategy language for graph rewriting

Cited in

(34)

• 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
• The Lean 4 theorem prover and programming language
• A general framework for types in graph rewriting
• A bi-directional extensible interface between Lean and Mathematica
• Labelled graph rewriting meets social networks
• On term-graph rewrite strategies
• Sharing in the graph rewriting calculus
• Root-neededness and approximations of neededness
• Three Syntactic Theories for Combinatory Graph Reduction
• On GS-monoidal theories for graphs with nesting
• A Rewriting Logic Approach to Type Inference
• scientific article; zbMATH DE number 4030948 (Why is no real title available?)
• Formal specification of a graph rewriting system with environments
• Rewriting on cyclic structures: Equivalence between the operational and the categorical description
• Böhm Reduction in Infinitary Term Graph Rewriting Systems
• On the complexity of deduction modulo leaf permutative equations
• Compiling collapsing rules in certain constructor systems
• 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

This page was built for publication: LEAN: An intermediate language based on graph rewriting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1823673)