Sciweavers

62 search results - page 4 / 13
» Lightweight Family Polymorphism
Sort
View
JACM
2007
84views more  JACM 2007»
13 years 9 months ago
Polymorphic higher-order recursive path orderings
This paper extends the termination proof techniques based on reduction orderings to a higher-order setting, by defining a family of recursive path orderings for terms of a typed ...
Jean-Pierre Jouannaud, Albert Rubio
CHI
2004
ACM
14 years 10 months ago
Supporting social presence through lightweight photo sharing on and off the desktop
Lightweight photo sharing, particularly via mobile devices, is fast becoming a common communication medium used for maintaining a presence in the lives of friends and family. How ...
Scott Counts, Eric Fellheimer
HASKELL
2005
ACM
14 years 3 months ago
TypeCase: a design pattern for type-indexed functions
A type-indexed function is a function that is defined for each member of some family of types. Haskell’s type class mechanism provides collections of open type-indexed function...
Bruno C. D. S. Oliveira, Jeremy Gibbons
HICSS
2006
IEEE
135views Biometrics» more  HICSS 2006»
14 years 3 months ago
Using Function Generalization to Design a Cosequential Processing Framework
Abstract— Framework design is a multifaceted endeavor undertaken to promote reuse of software within a family of related applications. Traditional approaches involve either the e...
H. Conrad Cunningham, Pallavi Tadepalli
ICFP
2010
ACM
13 years 11 months ago
Regular, shape-polymorphic, parallel arrays in Haskell
We present a novel approach to regular, multi-dimensional arrays in Haskell. The main highlights of our approach are that it (1) is purely functional, (2) supports reuse through s...
Gabriele Keller, Manuel M. T. Chakravarty, Roman L...