Omnidirectional type inference restores principality for ML extensions with fragile constructs via dynamic constraint solving with suspended matches and incremental instantiation of generalized types.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
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.
citing papers explorer
-
Omnidirectional type inference for ML: principality any way
Omnidirectional type inference restores principality for ML extensions with fragile constructs via dynamic constraint solving with suspended matches and incremental instantiation of generalized types.
-
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.