A full continuous model of polymorphism

DOI10.1016/S0304-3975(01)00379-6zbMath1018.68015OpenAlexW2032069744MaRDI QIDQ1853594

Stefano Berardi, Franco Barbanera

Publication date: 21 January 2003

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

Full work available at URL: https://doi.org/10.1016/s0304-3975(01)00379-6

zbMATH Keywords

Scott domainsecond-order lambda calculusnon-parametric model

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Related Items (2)

Internal models of system F for decompilation ⋮ Building continuous webbed models for system F

Cites Work

• Unnamed Item
• The semantics of second-order lambda calculus
• The lambda calculus. Its syntax and semantics. Rev. ed.
• Retractions of dI-domains as a model for Type:Type
• The genericity theorem and parametricity in the polymorphic \(\lambda\)- calculus
• Domain theoretic models of polymorphism
• Rétractions et interprétation interne du polymorphisme : le problème de la rétraction universelle

This page was built for publication: A full continuous model of polymorphism