A simple type system for combinatory logic gives combinators one type each, with polymorphism revealed by application, supporting more polymorphism than Hindley-Milner without quantified types and including type inference.
The octagon abstract domain.Higher-order and symbolic compu- tation, 19:31–100, 2006
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Simple Types for Polymorphic Functions
A simple type system for combinatory logic gives combinators one type each, with polymorphism revealed by application, supporting more polymorphism than Hindley-Milner without quantified types and including type inference.