A complete characterization of complete intersection-type preorders

DOI10.1145/601775.601780zbMATH Open1365.03015OpenAlexW2023743160MaRDI QIDQ5267426FDOQ5267426

Authors: Mariangiola Dezani-Ciancaglini, Furio Honsell, Fabio Alessi 

Publication date: 13 June 2017

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/601775.601780

Recommendations

• scientific article; zbMATH DE number 1456951
• A characterization of F-complete type assignments
• Complete restrictions of the intersection type discipline
• Completeness of intersection and union type assignment systems for call-by-value \(\lambda\)-models
• Intersection types and lambda models

zbMATH Keywords

completenesslambda calculusintersection typeslambda models

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Functional programming and lambda calculus (68N18)

Cited In (14)

• Coinductive Characterisations Reveal Nice Relations Between Preorders and Equivalences
• A Filter Model for the λμ-Calculus
• Compositional characterisations of \(\lambda\)-terms using intersection types
• Recursive Domain Equations of Filter Models
• Type preorders and recursive terms
• Unions of rank/trace complete preorders
• A type assignment system for game semantics
• Characterizations of pretameness and the Ord-cc
• Title not available (Why is that?)
• From semantics to types: the case of the imperative \(\lambda\)-calculus
• Intersection types and lambda models
• An irregular filter model
• 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

This page was built for publication: A complete characterization of complete intersection-type preorders

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5267426)