Building continuous webbed models for system F
From MaRDI portal
Publication:1826624
DOI10.1016/j.tcs.2003.11.011zbMath1079.03017OpenAlexW2035256009MaRDI QIDQ1826624
Stefano Berardi, Chantal Berline
Publication date: 6 August 2004
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2003.11.011
Functional programming and lambda calculus (68N18) Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Combinatory logic and lambda calculus (03B40)
Related Items
Cites Work
- The lambda calculus. Its syntax and semantics. Rev. ed.
- Retractions of dI-domains as a model for Type:Type
- Set-theoretical models of lambda-calculus: theories, expansions, isomorphisms
- The system \({\mathcal F}\) of variable types, fifteen years later
- Petri nets, event structures and domains. I
- The genericity theorem and parametricity in the polymorphic \(\lambda\)- calculus
- From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models
- Domain theoretic models of polymorphism
- A full continuous model of polymorphism
- Universal retractions on \(DI\)-domains
- Rétractions et interprétation interne du polymorphisme : le problème de la rétraction universelle
- Data Types as Lattices
- βη-complete models for System F
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item