Properties of a first-order functional language with sharing

DOI10.1016/0304-3975(94)00185-LMaRDI QIDQ673126zbMATH OpenFDO

Authors Zena M. Ariola, Arvind

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)

Recommendations

• A first-order language for expressing sharing and type properties of logic programs
• Processes, Terms and Cycles: Steps on the Road to Infinity
• First-order functional languages and intensional logic
• Maximal sharing in the lambda calculus with letrec
• scientific article; zbMATH DE number 4011906
• An operational semantics of sharing in lazy evaluation
• An abstract view on syntax with sharing
• scientific article; zbMATH DE number 859787
• Sharing in the graph rewriting calculus

Cites work

• scientific article; zbMATH DE number 3907750 (Why is no real title available?)
• scientific article; zbMATH DE number 4030948 (Why is no real title available?)
• scientific article; zbMATH DE number 48630 (Why is no real title available?)
• scientific article; zbMATH DE number 3619855 (Why is no real title available?)
• Implementing term rewrite languages in DACTL
• LEAN: An intermediate language based on graph rewriting
• Relating graph and term rewriting via Böhm models
• The lambda calculus. Its syntax and semantics. Rev. ed.
• Transfinite reductions in orthogonal term rewriting systems

Cited in

(10)

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

Describes a project that uses

Uses Software

• CLEAN
• DACTL

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

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