3713 search results - page 513 / 743 » Constructing a Calculus of Programs |
222
Voted
POPL
2005
ACM
16 years 3 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...
264
click to vote
STOC
2003
ACM
16 years 3 months ago
2003
ACM
In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...
205
Voted
SIGMOD
2007
ACM
16 years 3 months ago
2007
ACM
Traditional client-server applications relegate query and persistence operations on their data to database systems. The database system operates on data in the form of rows and ta...
136
Voted
ICFP
2007
ACM
16 years 3 months ago
2007
ACM
The MLF type system by Le Botlan and R?emy (2003) is a natural extension of Hindley-Milner type inference that supports full firstclass polymorphism, where types can be of higher-...
155
Voted
ICFP
2006
ACM
16 years 3 months ago
2006
ACM
This paper introduces a pattern for almost compositional functions over recursive data types, and over families of mutually recursive data types. Here "almost compositional&q...