Sciweavers

1368 search results - page 41 / 274
» Recursive modules for programming
Sort
View
ICFP
2004
ACM
14 years 7 months ago
Numbering matters: first-order canonical forms for second-order recursive types
We study a type system equipped with universal types and equirecursive types, which we refer to as F?. We show that type equality may be decided in time O(n log n), an improvement...
François Pottier, Nadji Gauthier
LICS
1997
IEEE
14 years 1 days ago
Induction and Recursion on the Partial Real Line via Biquotients of Bifree Algebras
The partial real line is the continuous domain of compact real intervals ordered by reverse inclusion. The idea is that singleton intervals represent total real numbers, and that ...
Martín Hötzel Escardó, Thomas S...
GREC
2005
Springer
14 years 1 months ago
Online Composite Sketchy Shape Recognition Using Dynamic Programming
This paper presents a solution for online composite sketchy shape recognition. The kernel of the strategy treats both stroke segmentation and sketch recognition as an optimization ...
Zhengxing Sun, Bo Yuan, Jianfeng Yin
APLAS
2008
ACM
13 years 9 months ago
ML Modules and Haskell Type Classes: A Constructive Comparison
Researchers repeatedly observed that the module system of ML and the type class mechanism of Haskell are related. So far, this relationship has received little formal investigation...
Stefan Wehr, Manuel M. T. Chakravarty
POPL
2000
ACM
14 years 6 days ago
(Optimal) Duplication is not Elementary Recursive
In 1998 Asperti and Mairson proved that the cost of reducing a lambda-term using an optimal lambda-reducer (a la L´evy) cannot be bound by any elementary function in the number o...
Andrea Asperti, Paolo Coppola, Simone Martini