2290 search results - page 65 / 458 » Extensible Protected Types |
249
Voted
ICFP
2009
ACM
16 years 2 months ago
2009
ACM
GADTs have proven to be an invaluable language extension, a.o. for ensuring data invariants and program correctness. Unfortunately, they pose a tough problem for type inference: w...
115
Voted
LICS
1999
IEEE
15 years 6 months ago
1999
IEEE
The problem of defining and checking a subtype relation between recursive types was studied in [3] for a first order type system, but for second order systems, which combine subty...
108
Voted
ICALP
2004
Springer
15 years 7 months ago
2004
Springer
We show that strictly positive inductive types, constructed from polynomial functors, constant exponentiation and arbitrarily nested inductive types exist in any Martin-L¨of categ...
132
Voted
ESOP
2000
Springer
15 years 5 months ago
2000
Springer
Abstract. We propose a new type discipline for the -calculus in which secure information flow is guaranteed by static type checking. Secrecy levels are assigned to channels and are...
120
click to vote
LICS
2010
IEEE
15 years 19 days ago
2010
IEEE
—There are two usual ways to describe equality in a dependent typing system, one that uses an external notion of computation like beta-reduction, and one that introduces a typed ...