Sciweavers

18429 search results - page 44 / 3686
» Typing dynamic typing
Sort
View
JFP
2007
136views more  JFP 2007»
13 years 10 months ago
Practical type inference for arbitrary-rank types
Haskell’s popularity has driven the need for ever more expressive type system features, most of which threaten the decidability and practicality of Damas-Milner type inference. ...
Simon L. Peyton Jones, Dimitrios Vytiniotis, Steph...
LICS
2000
IEEE
14 years 2 months ago
A Model for Impredicative Type Systems, Universes, Intersection Types and Subtyping
We introduce a new model based on coherence spaces for interpreting large impredicative type systems such as the Extended Calculus of Constructions (ECC). Moreover, we show that t...
Alexandre Miquel
TPHOL
2007
IEEE
14 years 4 months ago
Simple Types in Type Theory: Deep and Shallow Encodings
Abstract. We present a formal treatment of normalization by evaluation in type theory. The involved semantics of simply-typed λ-calculus is exactly the simply typed fragment of th...
François Garillot, Benjamin Werner
ULPAA
1994
152views Hardware» more  ULPAA 1994»
13 years 11 months ago
Programming with ASN.1 Using Polymorphic Types and Type Specialization
object-oriented abstractions is described that permits direct programming with ASN.1 speci ed types. The design and implementation also supports the exible use of di erent encoding...
R. Greg Lavender, Dennis G. Kafura, R. W. Mullins
ICFP
2005
ACM
14 years 10 months ago
Type inference, principal typings, and let-polymorphism for first-class mixin modules
module is a programming abstraction that simultaneously generalizes -abstractions, records, and mutually recursive definitions. Although various mixin module type systems have bee...
Henning Makholm, J. B. Wells