Types with intersection: An introduction

DOI10.1007/BF01211394zbMath0774.03002MaRDI QIDQ1201298

J. Roger Hindley

Publication date: 17 January 1993

Published in: Formal Aspects of Computing (Search for Journal in Brave)

zbMATH Keywords

combinationlambda-calculustype theory with intersection

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) Combinatory logic and lambda calculus (03B40)

Related Items (5)

A classification of intersection type systems ⋮ On strong normalization and type inference in the intersection type discipline ⋮ Intersection types for combinatory logic ⋮ Generalized filter models ⋮ Elaborating intersection and union types

Uses Software

• Forsythe

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Principal type schemes for an extended type theory
• The completeness of provable realizability
• A characterization of F-complete type assignments
• Type theories, normal forms, and \(D_{\infty}\)-lambda-models
• An extension of basic functionality theory for \(\lambda\)-calculus
• Complete restrictions of the intersection type discipline
• Intersection types for combinatory logic
• A new type assignment for λ-terms
• A filter lambda model and the completeness of type assignment
• Characterization theorems for a filter lambda model
• Functional Characters of Solvable Terms
• Principal Typing in a ∀Λ-Discipline
• Modified basic functionality in combinatory logic
• A formulation of the simple theory of types

This page was built for publication: Types with intersection: An introduction