Type preorders

DOI10.1007/BFB0017472MaRDI QIDQ4954440zbMATH OpenFDO

Authors Fabio Alessi

Publication date 7 June 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0017472

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55)

Recommendations

• A complete characterization of complete intersection-type preorders
• Type preorders and recursive terms
• Infinite intersection types
• scientific article; zbMATH DE number 2242600
• Intersection types and lambda models

Cited in

(8)

• Infinite \(\lambda\)-calculus and types
• From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models
• On Ruppert's preordering
• Special classes of positive preorders
• Type preorders and recursive terms
• A complete characterization of complete intersection-type preorders
• Filter models for conjunctive-disjunctive \(\lambda\)-calculi
• An irregular filter model

This page was built for publication: Type preorders

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