Strong normalization from an unusual point of view

DOI10.1016/j.tcs.2010.12.018zbMath1222.03020OpenAlexW2014545693WikidataQ57722170 ScholiaQ57722170MaRDI QIDQ534700

Elaine Pimentel, Luca Paolini, Simonetta Ronchi della Rocca

Publication date: 10 May 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2010.12.018

zbMATH Keywords

strong normalizationcall-by-valueparametric lambda calculus

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Related Items

Open Call-by-Value

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The parametric lambda calculus. A metamodel for computation.
• Type theories, normal forms, and \(D_{\infty}\)-lambda-models
• An extension of basic functionality theory for \(\lambda\)-calculus
• The lambda calculus, its syntax and semantics
• Call-by-name, call-by-value and the \(\lambda\)-calculus
• Full abstraction in the lazy lambda calculus
• Parametric parameter passing \(\lambda\)-calculus
• A filter lambda model and the completeness of type assignment
• A Syntactic Characterization of the Equality in Some Models for the Lambda Calculus
• The Relation between Computational and Denotational Properties for Scott’s ${\text{D}}_\infty $-Models of the Lambda-Calculus
• A simple proof of the undecidability of strong normalisation
• Call-by-value Solvability
• Automata, Logic and Games for the $$\lambda $$ -Calculus
• Intensional interpretations of functionals of finite type I
• Some Properties of Conversion
• The Calculi of Lambda Conversion. (AM-6)
• Foundations of Software Science and Computation Structures