Logo image
Home Academic units
Sign in
Deciding ML typability is complete for deterministic exponential time
Conference proceeding

Deciding ML typability is complete for deterministic exponential time

Harry Mairson
Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pp.382-402
ACM SIGPLAN-SIGACT symposium on Principles of programming languages, 17 (San Francisco, CA, USA)
1990
url
Link to Full TextView

Metrics

1 Record Views

Details

Logo image