Redexes are stable in the λ-calculus

DOI10.1017/S0960129515000353zbMath1364.68139MaRDI QIDQ5269004

Jean-Jacques Levy

Publication date: 14 June 2017

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Theory of programming languages (68N15) Functional programming and lambda calculus (68N18) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Combinatory logic and lambda calculus (03B40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Paths, computations and labels in the \(\lambda\)-calculus
• The lambda calculus. Its syntax and semantics. Rev. ed.
• Sequential algorithms on concrete data structures
• LCF considered as a programming language
• A global representation of the recursive functions in the \(\lambda\)- calculus
• Full abstraction for PCF
• Combinatory logic. Vol. II
• Analysis and caching of dependencies
• From Semantics to Computer Science
• Minimal and Optimal Computations of Recursive Programs

This page was built for publication: Redexes are stable in the λ-calculus