Sciweavers

41 search results - page 4 / 9
» Optimizing the Runtime Processing of Types in Polymorphic Lo...
Sort
View
123
Voted
PLDI
2012
ACM
13 years 5 months ago
Fast and precise hybrid type inference for JavaScript
JavaScript performance is often bound by its dynamically typed nature. Compilers do not have access to static type information, making generation of efficient, type-specialized m...
Brian Hackett, Shu-yu Guo
150
Voted
POPL
2012
ACM
13 years 10 months ago
The ins and outs of gradual type inference
Gradual typing lets programmers evolve their dynamically typed programs by gradually adding explicit type annotations, which confer benefits like improved performance and fewer r...
Aseem Rastogi, Avik Chaudhuri, Basil Hosmer
125
Voted
SEMCO
2007
IEEE
15 years 9 months ago
Modeling Discriminative Global Inference
Many recent advances in complex domains such as Natural Language Processing (NLP) have taken a discriminative approach in conjunction with the global application of structural and...
Nicholas Rizzolo, Dan Roth
179
Voted
POPL
1994
ACM
15 years 6 months ago
Formally Optimal Boxing
An important implementation decision in polymorphically typed functional programming languages is whether to represent data in boxed or unboxed form and when to transform them fro...
Fritz Henglein, Jesper Jørgensen
150
Voted
LOPSTR
2005
Springer
15 years 8 months ago
Declarative Programming with Function Patterns
We propose an extension of functional logic languages that allows the definition of operations with patterns containing other defined operation symbols. Such “function patterns...
Sergio Antoy, Michael Hanus