18429 search results - page 113 / 3686 » Typing dynamic typing |
146
Voted
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Dependently typed -calculi such as the Logical Framework (LF) are capable of representing relationships between terms through types. By exploiting the "formulas-as-types"...
148
Voted
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Refinement types sharpen systems of simple and dependent types by offering expressive means to more precisely classify well-typed terms. We present a system of refinement types for...
114
Voted
FSTTCS
2009
Springer
15 years 11 months ago
2009
Springer
We report on our experiences in redesigning Scala’s collection libraries, focussing on the role that type systems play in keeping software architectures coherent over time. Type ...
125
click to vote
CIE
2007
Springer
15 years 10 months ago
2007
Springer
Concerning the set of rooted binary trees, one shows that Higman’s Lemma and Dershowitz’s recursive path ordering can be used for the decision of its maximal order type accordi...
110
click to vote
ESOP
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. This paper studies continuations by means of a polymorphic type system. The traditional call-by-name continuation passing style transform admits a typing in which some an...