Strong Normalizability as a Finiteness Structure via the Taylor Expansion of $$\lambda $$ λ -terms

DOI10.1007/978-3-662-49630-5_24zbMath1476.03009arXiv1603.07218OpenAlexW2305850023MaRDI QIDQ2811355

Michele Pagani, Christine Tasson, Lionel Vaux

Publication date: 10 June 2016

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1603.07218

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05) Combinatory logic and lambda calculus (03B40)

Related Items (7)

Taylor expansion, finiteness and strategies ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Visible acyclic differential nets. I: Semantics
• Uniformity and the Taylor expansion of ordinary lambda-terms
• Quantitative domains and infinitary algebras
• Complete restrictions of the intersection type discipline
• The differential lambda-calculus
• A filter lambda model and the completeness of type assignment
• The Cut-Elimination Theorem for Differential Nets with Promotion
• Weighted Relational Models of Typed Lambda-Calculi
• Finiteness spaces
• Logical Approaches to Computational Barriers

This page was built for publication: Strong Normalizability as a Finiteness Structure via the Taylor Expansion of $$\lambda $$ λ -terms