Non-idempotent intersection types in logical form

DOI10.1007/978-3-030-45231-5_11MaRDI QIDQ2200821zbMATH OpenOpenAlexFDO

Authors Thomas Ehrhard

Publication date 23 September 2020

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/1911.01899

zbMATH Keywords

linear logicdenotational semanticslambda calculusintersection types

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

Recommendations

• Non-idempotent intersection types for the lambda-calculus
• A tale of intersection types
• scientific article; zbMATH DE number 1841834
• Strict intersection types for the lambda calculus
• Intersection types for λGtz-calculus

Cites work

• scientific article; zbMATH DE number 482822 (Why is no real title available?)
• scientific article; zbMATH DE number 7559294 (Why is no real title available?)
• An extension of basic functionality theory for -calculus
• Coppo-Dezani types do not correspond to propositional logic
• Execution time of λ-terms via denotational semantics and intersection types
• Functional Characters of Solvable Terms
• Intersection-types à la Church
• Normal functors, power series and -calculus
• On phase semantics and denotational semantics in multiplicative-additive linear logic
• On phase semantics and denotational semantics: The exponentials
• Relational graph models at work
• The Scott model of linear logic is the extensional collapse of its relational model
• Uniformity and the Taylor expansion of ordinary lambda-terms

Cited in

(1)

• The Inhabitation Problem for Non-idempotent Intersection Types

This page was built for publication: Non-idempotent intersection types in logical form

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