Omnidirectional type inference restores principality for ML extensions with fragile constructs via dynamic constraint solving with suspended matches and incremental instantiation of generalized types.
InProceedings of the 9th ACM SIGPLAN- SIGACT Symposium on Principles of Programming Languages(Albuquerque, New Mexico)(POPL ’82)
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
verdicts
UNVERDICTED 3representative 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.
Applies established negative and fractional type dualities to the authors' existing NTU framework to enable new resolution forms in specialized compute modalities.
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.
-
Negative and Fractional Types in the Fidelity Framework
Applies established negative and fractional type dualities to the authors' existing NTU framework to enable new resolution forms in specialized compute modalities.