Properties of a first-order functional language with sharing
type: Item
instance of: scholarly article
title: Properties of a first-order functional language with sharing
zbMATH Open document ID: 0873.68016
DOI: 10.1016/0304-3975(94)00185-L
author: Zena M. Ariola
author: Arvind
published in: Theoretical Computer Science
publication date: 1997-02-28T00:00:00Z
Mathematics Subject Classification ID: 68N15
Mathematics Subject Classification ID: 68Q42
zbMATH DE Number: 985387
zbMATH Keywords: first-order functional language
zbMATH Keywords: graph rewriting system
describes a project that uses: DACTL
describes a project that uses: CLEAN
MaRDI profile type: Publication
cites work: Relating graph and term rewriting via Böhm models
cites work: The lambda calculus. Its syntax and semantics. Rev. ed.
cites work: LEAN: An intermediate language based on graph rewriting
cites work: Q3771589
cites work: Q3997501
cites work: Q3685171
cites work: Transfinite reductions in orthogonal term rewriting systems
cites work: Implementing term rewrite languages in DACTL
cites work: Q4182475
Recommended article: A first-order language for expressing sharing and type properties of logic programs
Recommended article: Processes, Terms and Cycles: Steps on the Road to Infinity
Recommended article: First-order functional languages and intensional logic
Recommended article: Maximal sharing in the lambda calculus with letrec
Recommended article: Q3761675
Recommended article: An operational semantics of sharing in lazy evaluation
Recommended article: An abstract view on syntax with sharing
Recommended article: Q4870559
Recommended article: Sharing in the Graph Rewriting Calculus
description: scientific article; zbMATH DE number 985387