Sciweavers

5 search results - page 1 / 1
» Gradual typing with unification-based inference
Sort
View
POPL
2012
ACM
12 years 2 days 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
DLS
2008
149views Languages» more  DLS 2008»
13 years 6 months ago
Gradual typing with unification-based inference
Static and dynamic type systems have well-known strengths and weaknesses. Gradual typing provides the benefits of both in a single language by giving the programmer control over w...
Jeremy G. Siek, Manish Vachharajani
POPL
1996
ACM
13 years 8 months ago
From Region Inference to von Neumann Machines via Region Representation Inference
Region Inference is a technique for implementing programming languages that are based on typed call-by-value lambda calculus, such as Standard ML. The mathematical runtime model o...
Lars Birkedal, Mads Tofte, Magnus Vejlstrup
FM
2009
Springer
190views Formal Methods» more  FM 2009»
13 years 11 months ago
Dynamic Classes: Modular Asynchronous Evolution of Distributed Concurrent Objects
Abstract. Many long-lived and distributed systems must remain available yet evolve over time, due to, e.g., bugfixes, feature extensions, or changing user requirements. To facilit...
Einar Broch Johnsen, Marcel Kyas, Ingrid Chieh Yu
ACL
1998
13 years 5 months ago
Processing Unknown Words in HPSG
The lexical acquisition system presented in this paper incrementallyupdates linguisticproperties of unknown words inferred from their surrounding context by parsing sentences with...
Petra Barg, Markus Walther