A complete characterization of complete intersection-type preorders

DOI10.1145/601775.601780zbMath1365.03015OpenAlexW2023743160MaRDI QIDQ5267426

Fabio Alessi, Furio Honsell, Mariangiola Dezani-Ciancaglini

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

zbMATH Keywords

completenesslambda calculusintersection typeslambda models

Mathematics Subject Classification ID

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

Related Items (8)

Intersection types and lambda models ⋮ From semantics to types: the case of the imperative \(\lambda\)-calculus ⋮ Calculi, types and applications: essays in honour of M. Coppo, M. Dezani-Ciancaglini and S. Ronchi della Rocca ⋮ An irregular filter model ⋮ A type assignment system for game semantics ⋮ A Filter Model for the λμ-Calculus ⋮ Recursive Domain Equations of Filter Models ⋮ Compositional characterisations of \(\lambda\)-terms using intersection types

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