Refinement types for program analysis

DOI10.1007/3-540-61739-6_39zbMath1482.68079OpenAlexW1514992909MaRDI QIDQ5030192

Paola Giannini, Ferruccio Damiani, Mario Coppo

Publication date: 16 February 2022

Published in: Static Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61739-6_39

zbMATH Keywords

type inferencetype assignmentbinding timefaithful refinementfaithful typing

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Related Items (1)

Calculi, types and applications: essays in honour of M. Coppo, M. Dezani-Ciancaglini and S. Ronchi della Rocca

Cites Work

• Unnamed Item
• Unnamed Item
• An extension of basic functionality theory for \(\lambda\)-calculus
• A theory of type polymorphism in programming
• Type inference, abstract interpretation and strictness analysis
• Strictness and totality analysis
• Principal types and unification for simple intersection type systems
• A filter lambda model and the completeness of type assignment
• Pruning simply typed  -terms
• The Principal Type-Scheme of an Object in Combinatory Logic

This page was built for publication: Refinement types for program analysis