Article

ML typability is Dexptime-complete

Authors:

A. J. Kfoury,

J. Tiuryn,

P. UrzyczynAuthors Info & Claims

CAAP '90: Proceedings of the fifteenth colloquium on CAAP'90

Pages 206 - 220

Published: 01 May 1990 Publication History

Abstract

No abstract available.

Cited By

View all

Sin'Ya RAsada KKobayashi NTsukada T(2017)Almost Every Simply Typed $$\lambda $$-Term Has a Long $$\beta $$-Reduction SequenceProceedings of the 20th International Conference on Foundations of Software Science and Computation Structures - Volume 1020310.1007/978-3-662-54458-7_4(53-68)Online publication date: 22-Apr-2017
https://dl.acm.org/doi/10.1007/978-3-662-54458-7_4
Pavlinovic ZKing TWies T(2015)Practical SMT-based type error localizationACM SIGPLAN Notices10.1145/2858949.278476550:9(412-423)Online publication date: 29-Aug-2015
https://dl.acm.org/doi/10.1145/2858949.2784765
Pavlinovic ZKing TWies TFisher KReppy J(2015)Practical SMT-based type error localizationProceedings of the 20th ACM SIGPLAN International Conference on Functional Programming10.1145/2784731.2784765(412-423)Online publication date: 29-Aug-2015
https://dl.acm.org/doi/10.1145/2784731.2784765
Show More Cited By

Recommendations

Deciding ML typability is complete for deterministic exponential time
POPL '90: Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages

A well known but incorrect piece of functional programming folklore is that ML expressions can be efficiently typed in polynomial time. In probing the truth of that folklore, various researchers, including Wand, Buneman, Kanellakis, and Mitchell, ...
An analysis of ML typability

We carry out an analysis of typability of terms in ML. Our main result is that this problem is DEXPTIME-hard, where by DEXPTIME we mean DTIME(2ⁿ⁰⁽¹⁾). This, together with the known exponential-time algorithm that solves the problem, yields the DEXPTIME-...
Typability is Undecidable for F+Eta

Comments

Information & Contributors

Information

Published In

CAAP '90: Proceedings of the fifteenth colloquium on CAAP'90

May 1990

284 pages

ISBN:0387525904

Editor:
André Arnold
Univ. de Bordeaux I, Talence, France

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 01 May 1990

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

9
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 04 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Sin'Ya RAsada KKobayashi NTsukada T(2017)Almost Every Simply Typed $$\lambda $$-Term Has a Long $$\beta $$-Reduction SequenceProceedings of the 20th International Conference on Foundations of Software Science and Computation Structures - Volume 1020310.1007/978-3-662-54458-7_4(53-68)Online publication date: 22-Apr-2017
https://dl.acm.org/doi/10.1007/978-3-662-54458-7_4
Pavlinovic ZKing TWies T(2015)Practical SMT-based type error localizationACM SIGPLAN Notices10.1145/2858949.278476550:9(412-423)Online publication date: 29-Aug-2015
https://dl.acm.org/doi/10.1145/2858949.2784765
Pavlinovic ZKing TWies TFisher KReppy J(2015)Practical SMT-based type error localizationProceedings of the 20th ACM SIGPLAN International Conference on Functional Programming10.1145/2784731.2784765(412-423)Online publication date: 29-Aug-2015
https://dl.acm.org/doi/10.1145/2784731.2784765
Pavlinovic ZKing TWies T(2014)Finding minimum type error sourcesACM SIGPLAN Notices10.1145/2714064.266023049:10(525-542)Online publication date: 15-Oct-2014
https://dl.acm.org/doi/10.1145/2714064.2660230
Pavlinovic ZKing TWies TBlack AMillstein T(2014)Finding minimum type error sourcesProceedings of the 2014 ACM International Conference on Object Oriented Programming Systems Languages & Applications10.1145/2660193.2660230(525-542)Online publication date: 15-Oct-2014
https://dl.acm.org/doi/10.1145/2660193.2660230
Kobayashi N(2013)Model Checking Higher-Order ProgramsJournal of the ACM10.1145/2487241.248724660:3(1-62)Online publication date: 1-Jun-2013
https://dl.acm.org/doi/10.1145/2487241.2487246
Kfoury AWells J(1994)A direct algorithm for type inference in the rank-2 fragment of the second-order λ-calculusACM SIGPLAN Lisp Pointers10.1145/182590.182456VII:3(196-207)Online publication date: 1-Jul-1994
https://dl.acm.org/doi/10.1145/182590.182456
Kfoury AWells JKessler R(1994)A direct algorithm for type inference in the rank-2 fragment of the second-order λ-calculusProceedings of the 1994 ACM conference on LISP and functional programming10.1145/182409.182456(196-207)Online publication date: 1-Jul-1994
https://dl.acm.org/doi/10.1145/182409.182456
Henglein FMairson HWise D(1991)The complexity of type inference for higher-order lambda calculiProceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages10.1145/99583.99602(119-130)Online publication date: 3-Jan-1991
https://dl.acm.org/doi/10.1145/99583.99602

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Deciding ML typability is complete for deterministic exponential time

An analysis of ML typability

Typability is Undecidable for F+Eta

Comments

Published In

Publisher

Publication History

Qualifiers

Other Metrics

Article Metrics

Other Metrics

Cited By

Login options

Full Access

Abstract

Cited By

Index Terms

Recommendations

Deciding ML typability is complete for deterministic exponential time

An analysis of ML typability

Typability is Undecidable for F+Eta

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations