\(\pi\)-RED - a graph reducer for a full-fledged \(\lambda\)-calculus

DOI10.1007/BF03037478zbMath0741.68025OpenAlexW2070912653MaRDI QIDQ1186104

H. Blödorn, C. Schmittgen, Werner Kluge

Publication date: 28 June 1992

Published in: New Generation Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf03037478

zbMATH Keywords

functional programminggraph-reduction machinehigh-level interpretation

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Combinatory logic and lambda calculus (03B40)

Related Items

π-RED⁺ An interactive compiling graph reduction system for an applied λ-calculus

Uses Software

• ML
• Miranda

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A theory of type polymorphism in programming
• User-Defined Types in a Polymorphic Language
• A consistent extension of the lambda-calculus as a base for functional programming languages
• A new implementation technique for applicative languages

This page was built for publication: \(\pi\)-RED - a graph reducer for a full-fledged \(\lambda\)-calculus