Sciweavers

18429 search results - page 138 / 3686
» Typing dynamic typing
Sort
View
WOLLIC
2009
Springer
15 years 11 months ago
Recognizability in the Simply Typed Lambda-Calculus
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...
Sylvain Salvati
TLDI
2005
ACM
151views Formal Methods» more  TLDI 2005»
15 years 10 months ago
Strict bidirectional type checking
Completely annotated lambda terms (such as are arrived at via the straightforward encodings of various types from System F) contain much redundant type information. Consequently, ...
Adam J. Chlipala, Leaf Petersen, Robert Harper
CDC
2009
IEEE
114views Control Systems» more  CDC 2009»
15 years 9 months ago
A computable type theory for control systems
— 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...
Pieter Collins
155
Voted
CSL
2000
Springer
15 years 9 months ago
Interactive Programs in Dependent Type Theory
We introduce basic concepts from object-oriented programming into dependent type theory based on the idea of modelling objects as interactive programs. We consider methods, interf...
Peter Hancock, Anton Setzer
138
Voted
ECOOP
1999
Springer
15 years 9 months ago
Foundations for Virtual Types
Virtual types have been proposed as a notation for generic programming in object-oriented languages—an alternative to the more familiar mechanism of parametric classes. The trade...
Atsushi Igarashi, Benjamin C. Pierce