Pages that link to "Item:Q1823673"
From MaRDI portal
The following pages link to LEAN: An intermediate language based on graph rewriting (Q1823673):
Displaying 29 items.
- Root-neededness and approximations of neededness (Q293367) (← links)
- On the complexity of deduction modulo leaf permutative equations (Q556681) (← links)
- Locating the contractum in the double pushout approach (Q672236) (← links)
- Properties of a first-order functional language with sharing (Q673126) (← links)
- Modularity in noncopying term rewriting (Q673186) (← links)
- Hyperedge replacement jungle rewriting for term-rewriting systems and logic programming (Q685465) (← links)
- An operational semantics for paragon: A design notation for parallel architectures (Q756433) (← links)
- Implementing term rewrite languages in DACTL (Q912591) (← links)
- On ``On graph rewritings'' (Q1098284) (← links)
- Term graph rewriting and garbage collection using opfibrations (Q1331928) (← links)
- Transitive term graph rewriting (Q1350096) (← links)
- Normalization results for typeable rewrite systems (Q1357006) (← links)
- Lambda calculus with explicit recursion (Q1383145) (← links)
- Computing in unpredictable environments: semantics, reduction strategies, and program transformations (Q1389440) (← links)
- Generating irregular partitionable data structures (Q1575237) (← links)
- A uniform framework for term and graph rewriting applied to combined systems (Q1583048) (← links)
- Dynamic connectors for concurrency (Q1603689) (← links)
- Normal forms for algebras of connections. (Q1853455) (← links)
- Context-sensitive rewriting strategies (Q1854569) (← links)
- Relating graph and term rewriting via Böhm models (Q1924551) (← links)
- A general framework for types in graph rewriting (Q2581012) (← links)
- Labelled Graph Rewriting Meets Social Networks (Q2827834) (← links)
- On Term-Graph Rewrite Strategies (Q2873679) (← links)
- Sharing in the Graph Rewriting Calculus (Q2890320) (← links)
- Three Syntactic Theories for Combinatory Graph Reduction (Q3003482) (← links)
- On GS-Monoidal Theories for Graphs with Nesting (Q3059707) (← links)
- A Rewriting Logic Approach to Type Inference (Q3184729) (← links)
- Rewriting on cyclic structures: Equivalence between the operational and the categorical description (Q4943554) (← links)
- Böhm Reduction in Infinitary Term Graph Rewriting Systems (Q5111303) (← links)
