Concise example of exponential cost of ML type inference
Posted by mrrusof, at cs.stackexchange.com,
It was brought to my attention that the cost of type inference in a functional language like OCaml can be very high. The claim…
CAAP '90
Overview of attention for book
Table of Contents
-
Altmetric BadgeBook Overview
-
Altmetric BadgeChapter 37 On the power of bounded concurrency II: The pushdown automata level
-
Altmetric BadgeChapter 38 Trees everywhere
-
Altmetric BadgeChapter 39 Combinatory forms for equational programming: Instances, unification and narrowing
-
Altmetric BadgeChapter 40 Graphical versus logical specifications
-
Altmetric BadgeChapter 41 More efficient bottom-up tree pattern matching
-
Altmetric BadgeChapter 42 On the regular structure of prefix rewriting
-
Altmetric BadgeChapter 43 A unified approach for showing language containment and equivalence between various types of ω-automata
-
Altmetric BadgeChapter 44 Unitary monoid with two generators: An algorithmic point of view
-
Altmetric BadgeChapter 45 Coherence of subsumption
-
Altmetric BadgeChapter 46 Petri nets as models of linear logic
-
Altmetric BadgeChapter 47 Towards the unification of models for concurrency
-
Altmetric BadgeChapter 48 A markovian concurrency measure
-
Altmetric BadgeChapter 49 Graph matching in operational semantics and typing
-
Altmetric BadgeChapter 50 ML typability is dexptime-complete
-
Altmetric BadgeChapter 51 Testing for inductiue (co)-reducibility
-
Altmetric BadgeChapter 52 Probabilistic analysis of some distributed algorithms
-
Altmetric BadgeChapter 53 Infinite values in hierarchical imperative types
-
Altmetric BadgeChapter 54 Equivalence of finite-valued bottom-up finite state tree transducers is decidable
Altmetric Badge
About this Attention Score
-
In the top 25% of all research outputs scored by Altmetric
-
High Attention Score compared to outputs of the same age (89th percentile)
Citations
- dimensions_citation
- 1 Dimensions
Readers on
- mendeley
- 8 Mendeley