Needed reduction and spine strategies for the lambda calculus

DOI10.1016/0890-5401(87)90001-0zbMath0635.03009OpenAlexW2147478629MaRDI QIDQ1097253

Hendrik Pieter Barendregt, M. R. Sleep, J. R. Kennaway, Jan Willem Klop

Publication date: 1987

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://ir.cwi.nl/pub/1726

zbMATH Keywords

programming languagesreduction to normal formneeded redexspine redexes

Mathematics Subject Classification ID

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

Related Items

A safe approach to parallel combinator reduction, A unified approach to type theory through a refined \(\lambda\)-calculus, A Logical Interpretation of the λ-Calculus into the π-Calculus, Preserving Spine Reduction and Types, Highlights in infinitary rewriting and lambda calculus, Refining reduction in the lambda calculus, Making ``stricterness more relevant, Sequentiality in orthogonal term rewriting systems, Strictness analysis via abstract interpretation for recursively defined types, The full-reducing Krivine abstract machine KN simulates pure normal-order reduction in lockstep: A proof via corresponding calculus, Perpetual reductions in \(\lambda\)-calculus, Descendants and origins in term rewriting., Relative normalization in Deterministic Residual Structures

Uses Software

• Miranda

Cites Work

• Strictness analysis for higher-order functions
• Edinburgh LCF. A mechanized logic of computation
• Sequential evaluation strategies for parallel-or and related reduction systems
• A new implementation technique for applicative languages
• Minimal and Optimal Computations of Recursive Programs
• The next 700 programming languages
• The Mechanical Evaluation of Expressions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item