1614 search results - page 235 / 323 » Polymorphism and Genetic Programming |
IWMM
2007
Springer
14 years 5 months ago
2007
Springer
In this work, we present accordion arrays, a straightforward and effective memory compression technique targeting Unicode-based character arrays. In many non-numeric Java programs...
FOSSACS
2003
Springer
14 years 4 months ago
2003
Springer
Abstract. We solve the problem of extending Bird and Paterson’s generalized folds for nested datatypes and its dual to inductive and coinductive constructors of arbitrarily high ...
APSEC
1998
IEEE
14 years 3 months ago
1998
IEEE
Modified programs are required to be retested to determine whether changes have been made correctly and to investigate whether those cause any adverse effect on the program behavi...
ICFP
1997
ACM
14 years 3 months ago
1997
ACM
We show how to implement a calculus with higher-order subtyping and subkinding by replacing uses of implicit subsumption with explicit coercions. To ensure this can be done, a pol...
ESOP
2006
Springer
14 years 2 months ago
2006
Springer
We present a sound and complete proof technique, based on syntactic logical relations, for showing contextual equivalence of expressions in a -calculus with recursive types and imp...