1999 search results - page 148 / 400 » Dependently Typed Grammars |
165
click to vote
LACL
2001
Springer
15 years 10 months ago
2001
Springer
In categorial systems with a fixed structural component, the learning problem comes down to finding the solution for a set of typeassignment equations. A hard-wired structural co...
292
click to vote
POPL
2009
ACM
16 years 7 months ago
2009
ACM
Mitchell's notion of representation independence is a particularly useful application of Reynolds' relational parametricity -- two different implementations of an abstra...
184
click to vote
ICML
2000
IEEE
16 years 7 months ago
2000
IEEE
Clustering algorithms conduct a search through the space of possible organizations of a data set. In this paper, we propose two types of instance-level clustering constraints ? mu...
153
click to vote
FSEN
2009
Springer
16 years 29 days ago
2009
Springer
We present a general technique for extending Java-like languages with dynamic overloading, where method selection depends on the dynamic type of the parameter, instead of just the ...
176
click to vote
APLAS
2009
ACM
16 years 27 days ago
2009
ACM
Restricting destructive update to values of a distinguished reference type prevents functions from being polymorphic in the mutability of their arguments. This restriction makes it...