On functions preserving levels of approximation: A refined model construction for various lambda calculi

DOI10.1016/S0304-3975(98)00144-3zbMath0913.68136MaRDI QIDQ1275633

Dieter Spreen

Publication date: 12 January 1999

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

zbMATH Keywords

dI-domains\(\lambda\)-model\(\lambda \beta\)p-calculus\(\lambda\)-algebraapproximation structureprojection morphism

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Combinatory logic and lambda calculus (03B40)

Related Items (2)

Uniform Completion versus Ideal Completion of Posets with Projections ⋮ Corrigendum to ``On functions preserving levels of approximation: A refined model construction for various lambda calculi

Cites Work

• The lambda calculus. Its syntax and semantics. Rev. ed.
• Retractions of dI-domains as a model for Type:Type
• Recursion over realizability structures
• Models of the lambda calculus
• Lambda‐Calculus Models and Extensionality
• The Category-Theoretic Solution of Recursive Domain Equations
• A Powerdomain Construction
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On functions preserving levels of approximation: A refined model construction for various lambda calculi