Skip to content

Deciding ML Typability is Complete for Deterministic Exponential Time.

Harry G. Mairson

VenueA*POPL
Year1990
ProceedingsPOPL

Browse the full POPL paper archive.