Intersection types and lambda models
From MaRDI portal
Publication:2369008
DOI10.1016/J.TCS.2006.01.004zbMATH Open1088.68031OpenAlexW2139609129MaRDI QIDQ2369008FDOQ2369008
Authors: Fabio Alessi, Franco Barbanera, Mariangiola Dezani-Ciancaglini 
Publication date: 28 April 2006
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2006.01.004
Recommendations
- A typed lambda calculus with intersection types
- Strict intersection types for the lambda calculus
- Intersection types for light affine lambda calculus
- Full intersection types and topologies in lambda calculus
- Intersection typed \(\lambda \)-calculus
- Non-idempotent intersection types for the lambda-calculus
- Intersection types for the \(\lambda\mu\)-calculus
- Intersection types for lambda-terms and combinators and their logics
- Intersection types for \(\lambda\)-trees
- Intersection types for the resource control lambda calculi
Cites Work
- Domain theory in logical form
- Call-by-name, call-by-value and the \(\lambda\)-calculus
- Combinatory logic. With two sections by William Craig.
- The lambda calculus. Its syntax and semantics. Rev. ed.
- Title not available (Why is that?)
- Type theories, normal forms, and \(D_{\infty}\)-lambda-models
- Algebras and combinators
- Title not available (Why is that?)
- Title not available (Why is that?)
- Simple easy terms
- A filter lambda model and the completeness of type assignment
- Title not available (Why is that?)
- Complete restrictions of the intersection type discipline
- Functional Characters of Solvable Terms
- Full abstraction in the lazy lambda calculus
- Set-theoretical and other elementary models of the \(\lambda\)-calculus
- Lambda‐Calculus Models and Extensionality
- Title not available (Why is that?)
- An approximation theorem for topological lambda models and the topological incompleteness of lambda calculus
- Intersection types and computational rules
- Semantical analysis of perpetual strategies in \(\lambda\)-calculus
- Intersection types and domain operators
- Behavioural inverse limit \(\lambda\)-models
- Compositional characterisations of \(\lambda\)-terms using intersection types
- Title not available (Why is that?)
- Title not available (Why is that?)
- A complete characterization of complete intersection-type preorders
- Types for Proofs and Programs
- Title not available (Why is that?)
Cited In (22)
- Logical semantics for stability
- Title not available (Why is that?)
- A Filter Model for the λμ-Calculus
- Essential and relational models
- Polar type inference with intersection types and \(\omega\)
- Title not available (Why is that?)
- Intersection types for \(\lambda\)-trees
- Inhabitation of Low-Rank Intersection Types
- A completeness result for a realisability semantics for an intersection type system
- Strict intersection types for the lambda calculus
- Intersection types and computational rules
- Intersection types for light affine lambda calculus
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- From semantics to types: the case of the imperative \(\lambda\)-calculus
- A complete characterization of complete intersection-type preorders
- A typed lambda calculus with intersection types
- Calculi, types and applications: essays in honour of M. Coppo, M. Dezani-Ciancaglini and S. Ronchi della Rocca
- From semantics to types: the case of the imperative \(\lambda\)-calculus
- Title not available (Why is that?)
- Intersection types and domain operators
This page was built for publication: Intersection types and lambda models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2369008)
