3071 search results - page 410 / 615 » Explanatory Design Theory |
290
click to vote
POPL
2006
ACM
16 years 7 months ago
2006
ACM
We propose a type system based on regular tree grammars, where algebraic datatypes are interpreted in a structural way. Thus, the same constructors can be reused for different typ...
297
click to vote
POPL
2005
ACM
16 years 6 months ago
2005
ACM
In traditional information-flow type systems, the security policy is often formalized as noninterference properties. However, noninterference alone is too strong to express securi...
277
click to vote
POPL
2005
ACM
16 years 6 months ago
2005
ACM
Haskell's type classes allow ad-hoc overloading, or typeindexing, of functions. A natural generalisation is to allow type-indexing of data types as well. It turns out that th...
255
click to vote
POPL
2004
ACM
16 years 6 months ago
2004
ACM
The contribution of the paper is twofold. First, we define a general notion of type system equipped with an entailment relation between type environments; this generalisation serv...
281
click to vote
POPL
2003
ACM
16 years 6 months ago
2003
ACM
We introduce a notion of guarded recursive (g.r.) datatype constructors, generalizing the notion of recursive datatypes in functional programming languages such as ML and Haskell....