Redexes are stable in the -calculus

DOI10.1017/S0960129515000353zbMATH Open1364.68139MaRDI QIDQ5269004FDOQ5269004

Authors: Jean-Jacques Lévy 

Publication date: 14 June 2017

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

Recommendations

• Paths, computations and labels in the \(\lambda\)-calculus
• Paths, computations and labels in the λ-calculus
• Stable results and relative normalization
• Refining reduction in the lambda calculus
• On the construction of stable models of untyped \(\lambda\)-calculus

Mathematics Subject Classification ID

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

Cites Work

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

This page was built for publication: Redexes are stable in the \(\lambda\)-calculus

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5269004)