Capturing strong reduction in director string calculus

DOI10.1016/0304-3975(93)90174-RzbMath0772.68015MaRDI QIDQ1208420

Vugranam Sreedhar, Kazem Taghva

Publication date: 16 May 1993

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

zbMATH Keywords

functional languagesimplementation\(\lambda\)-calculuscombinatory logicstrong reductiondirector string calculus

Mathematics Subject Classification ID

Theory of programming languages (68N15) Combinatory logic and lambda calculus (03B40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The lambda calculus. Its syntax and semantics. Rev. ed.
• Optimal evaluations of graph-like expressions
• Axioms for the Theory of Lambda-Conversion
• Director strings as combinators
• A new implementation technique for applicative languages

This page was built for publication: Capturing strong reduction in director string calculus