Type inference, abstract interpretation and strictness analysis
From MaRDI portal
Publication:1314350
DOI10.1016/0304-3975(93)90086-9zbMath0832.68008OpenAlexW2022290763MaRDI QIDQ1314350
Mario Coppo, Alberto José Ferrari
Publication date: 22 February 1994
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(93)90086-9
Related Items (9)
A Realizability Interpretation for Intersection and Union Types ⋮ The ``relevance of intersection and union types ⋮ The untyped computational \(\lambda \)-calculus and its intersection type discipline ⋮ Calculi, types and applications: essays in honour of M. Coppo, M. Dezani-Ciancaglini and S. Ronchi della Rocca ⋮ Filter models for conjunctive-disjunctive \(\lambda\)-calculi ⋮ Strictness, totality, and non-standard-type inference ⋮ Generalized filter models ⋮ Combining type disciplines ⋮ Refinement types for program analysis
Cites Work
- Completeness of type assignment in continuous lambda models
- The lambda calculus. Its syntax and semantics. Rev. ed.
- Strictness analysis for higher-order functions
- A characterization of F-complete type assignments
- Type theories, normal forms, and \(D_{\infty}\)-lambda-models
- Principal type scheme and unification for intersection type discipline
- Polymorphic type inference and containment
- Domain theory in logical form
- The completeness theorem for typing lambda-terms
- A filter lambda model and the completeness of type assignment
- An ideal model for recursive polymorphic types
- What is a model of the lambda calculus?
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Type inference, abstract interpretation and strictness analysis
