4211 search results - page 117 / 843 » Types as Abstract Interpretations |
135
Voted
WOLLIC
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We define a notion of recognizable sets of simply typed λterms that extends the notion of recognizable sets of strings or trees. This definition is based on finite mo...
104
Voted
CDC
2009
IEEE
15 years 8 months ago
2009
IEEE
— In this paper, we develop a theory of computable types suitable for the study of control systems. The theory uses type-two effectivity as the underlying computational model, bu...
130
Voted
POPL
1994
ACM
15 years 7 months ago
1994
ACM
This paper presents a variant of the SML module system roduces a strict distinction between abstract types and manifest types (types whose definitions are part of the module speci...
106
Voted
CIE
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. This paper extends the logical approach to computable analysis via Σ–definability to higher type continuous data such as functionals and operators. We employ definab...
137
Voted
ASIAN
1998
Springer
15 years 8 months ago
1998
Springer
Abstract. We present a constraint system OF of feature trees that is appropriate to specify and implement type inference for first-class messages. OF extends traditional systems of...