Properties of a first-order functional language with sharing

DOI10.1016/0304-3975(94)00185-LzbMath0873.68016MaRDI QIDQ673126

Arvind, Zena M. Ariola

Publication date: 28 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

first-order functional languagegraph rewriting system

Mathematics Subject Classification ID

Theory of programming languages (68N15) Grammars and rewriting systems (68Q42)

Related Items (8)

Lambda calculus with explicit recursion ⋮ Relating graph and term rewriting via Böhm models ⋮ Computing in unpredictable environments: semantics, reduction strategies, and program transformations ⋮ Safety of Nöcker's strictness analysis ⋮ Three Syntactic Theories for Combinatory Graph Reduction ⋮ Rewriting and narrowing for constructor systems with call-time choice semantics ⋮ On graph rewriting, reduction, and evaluation in the presence of cycles ⋮ Computing in unpredictable environments: Semantics, reduction strategies, and program transformations

Uses Software

• CLEAN
• DACTL

Cites Work

• The lambda calculus. Its syntax and semantics. Rev. ed.
• Implementing term rewrite languages in DACTL
• LEAN: An intermediate language based on graph rewriting
• Transfinite reductions in orthogonal term rewriting systems
• Relating graph and term rewriting via Böhm models
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Properties of a first-order functional language with sharing