Strictness, totality, and non-standard-type inference

DOI10.1016/S0304-3975(00)00348-0zbMath0984.68028OpenAlexW2067567074MaRDI QIDQ5958293

Mario Coppo, Ferruccio Damiani, Paola Giannini

Publication date: 3 March 2002

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

Full work available at URL: https://doi.org/10.1016/s0304-3975(00)00348-0

zbMATH Keywords

strictnessprogram analysisintersection typesnon-standard-type inferencetotality

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Related Items

Safety of Nöcker's strictness analysis ⋮ Making ``stricterness more relevant ⋮ Calculi, types and applications: essays in honour of M. Coppo, M. Dezani-Ciancaglini and S. Ronchi della Rocca ⋮ Derivation and inference of higher-order strictness types ⋮ Deciding inclusion of set constants over infinite non-strict data structures

Uses Software

• ML

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Completeness of type assignment in continuous lambda models
• Strictness analysis for higher-order functions
• An extension of basic functionality theory for \(\lambda\)-calculus
• LCF considered as a programming language
• A theory of type polymorphism in programming
• Type inference, abstract interpretation and strictness analysis
• Strictness and totality analysis
• A filter lambda model and the completeness of type assignment
• Functional Characters of Solvable Terms
• Conjunctive Type Systems and Abstract Interpretation of Higher-order Functional Programs
• Strictness and totality analysis with conjunction
• The Principal Type-Scheme of an Object in Combinatory Logic