Sciweavers

462 search results - page 16 / 93
» Function Types in Complete Type Inference
Sort
View
ICFP
2005
ACM
14 years 7 months ago
Qualified types for MLF
MLF is a type system that extends a functional language with impredicative rank-n polymorphism. Type inference remains possible and only in some clearly defined situations, a loca...
Andres Löh, Daan Leijen
CIE
2008
Springer
13 years 9 months ago
Principal Typings for Explicit Substitutions Calculi
Having principal typings (for short PT) is an important property of type systems. This property guarantees the possibility of type deduction which means it is possible to develop a...
Daniel Lima Ventura, Mauricio Ayala-Rincón,...
ICFP
1997
ACM
13 years 12 months ago
A Modular, Polyvariant, and Type-Based Closure Analysis
We observe that the principal typing property of a type system is the enabling technology for modularity and separate compilation [10]. We use this technology to formulate a modul...
Anindya Banerjee
LICS
1997
IEEE
13 years 12 months ago
The Complexity of Subtype Entailment for Simple Types
A subtyping 0 is entailed by a set of subtyping constraints C, written C j= 0, if every valuation (mapping of type variables to ground types) that satisfies C also satisfies 0. ...
Fritz Henglein, Jakob Rehof
PPDP
2010
Springer
13 years 6 months ago
Typed and unambiguous pattern matching on strings using regular expressions
We show how to achieve typed and unambiguous declarative pattern matching on strings using regular expressions extended with a simple recording operator. We give a characterizatio...
Claus Brabrand, Jakob G. Thomsen