3001 search results - page 66 / 601 » Recursive type generativity |
CGF
2010
15 years 4 hour ago
2010
Geometry processing applications frequently rely on octree structures, since they provide simple and efficient hierarchies for discrete data. However, octrees do not guarantee dire...
ENTCS
2006
14 years 12 months ago
2006
The LR parser generators that are bundled with many functional programming language implementations produce code that is untyped, needlessly inefficient, or both. We show that, us...
195
click to vote
ICFP
2009
ACM
16 years 16 days ago
2009
ACM
A number of important program rewriting scenarios can be recast as type-directed coercion insertion. These range from more theoretical applications such as coercive subtyping and ...
TPHOL
2009
IEEE
15 years 6 months ago
2009
IEEE
Abstract. FinFuns are total functions that are constant except for a finite set of points, i.e. a generalisation of finite maps. We formalise them in Isabelle/HOL and present how...
102
click to vote
ICASSP
2009
IEEE
15 years 3 months ago
2009
IEEE
We derive a recursive general-radix pruned Cooley-Tukey fast Fourier transform (FFT) algorithm in Kronecker product notation. The algorithm is compatible with vectorization and pa...