Capturing strong reduction in director string calculus
type: Item
instance of: scholarly article
title: Capturing strong reduction in director string calculus
zbMATH Open document ID: 0772.68015
DOI: 10.1016/0304-3975(93)90174-R
author: Vugranam Sreedhar
author: Kazem Taghva
published in: Theoretical Computer Science
publication date: 1993-05-16T00:00:00Z
review text: A technique for implementing functional languages is based on the translation of terms from \(\lambda\)-calculus to combinatory logic. The authors present an extension of the work of \textit{R. Kennaway} and \textit{R. Sleep} [ACM Trans. Program. Lang. Syst. 10, No. 4, 602-626 (1988; Zbl 0669.68013)] to preserve strong reduction.
Mathematics Subject Classification ID: 68N15
Mathematics Subject Classification ID: 03B40
zbMATH DE Number: 166431
zbMATH Keywords: director string calculus
zbMATH Keywords: implementation
zbMATH Keywords: functional languages
zbMATH Keywords: \(\lambda\)-calculus
zbMATH Keywords: combinatory logic
zbMATH Keywords: strong reduction
reviewed by: Alberto Pettorossi
MaRDI profile type: Publication
cites work: The lambda calculus. Its syntax and semantics. Rev. ed.
cites work: Q5667469
cites work: Q5686017
cites work: Director strings as combinators
cites work: Q3918095
cites work: Q4692880
cites work: Axioms for the Theory of Lambda-Conversion
cites work: Optimal evaluations of graph-like expressions
cites work: A new implementation technique for applicative languages
description: scientific article; zbMATH DE number 166431