A lower bound for full polymorphic type inference: Girard-Reynolds Typability is DEXPTIME-hard
Publication date
1990
Authors
Henglein, F.H.
Editors
Advisors
Supervisors
DOI
Document Type
Report
Metadata
Show full item recordCollections
License
Abstract
Keywords
Wiskunde en Informatica (WIIN), Mathematics, Informatica, Landbouwwetenschappen, Natuurwetenschappen, Ordered by external client
Citation
Henglein, F H 1990, A lower bound for full polymorphic type inference: Girard-Reynolds Typability is DEXPTIME-hard. vol. 90-14, RUU-CS edn, Unknown Publisher, Utrecht. < http://www.cs.uu.nl/research/techreps/RUU-CS-90-14.html >