Completeness of transfinite evaluation in an extension of the lambda calculus

DOI10.2307/2273881MaRDI QIDQ3765742zbMATH OpenOpenAlexFDO

Authors Luis E. Sanchis

Publication date 1987

Published in Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2273881

zbMATH Keywords

completenesslambda-calculusmonotonic functionalssemanticstransfinite induction

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Other model constructions (03C30)

Recommendations

• Typed Lambda Calculi and Applications
• Completeness of continuation models for \(\lambda_\mu\)-calculus
• scientific article; zbMATH DE number 1567840
• Some results on extensionality in lambda calculus
• Strict ideal completions of the lambda calculus
• Finitary corecursion for the infinitary lambda calculus
• Towards lambda calculus order-incompleteness
• Infinitary lambda calculus
• Functional completeness of the mixed \(\lambda\)-calculus and combinatory logic
• Completeness Results for Lambek Syntactic Calculus

Cites work

• The Relation between Computational and Denotational Properties for Scott’s ${\text{D}}_\infty $-Models of the Lambda-Calculus

Cited in

(2)

• Structured meanings and reflexive domains
• On Proving Limiting Completeness

This page was built for publication: Completeness of transfinite evaluation in an extension of the lambda calculus

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