25 search results - page 3 / 5 » Monadic Presentations of Lambda Terms Using Generalized Indu... |
DBA
2006
13 years 6 months ago
2006
This paper presents an approach to produce generalization candidates for a concept hierarchy without the necessity of being an expert in the domain to be generalized and ...
HASKELL
2008
ACM
13 years 6 months ago
2008
ACM
We present Haskell libraries that statically ensure the safe use of resources such as file handles. We statically prevent accessing an already closed handle or forgetting to clos...
POPL
2010
ACM
14 years 2 months ago
2010
ACM
This paper introduces a new recursion principle for inductive data modulo -equivalence of bound names. It makes use of Oderskystyle local names when recursing over bound names. It...
ICFP
2009
ACM
14 years 6 months ago
2009
ACM
re a popular form of abstract computation. Being more general than monads, they are more broadly applicable, and in parare a good abstraction for signal processing and dataflow co...
SIGMOD
1998
ACM
13 years 9 months ago
1998
ACM
Semistructured data is characterized by the lack of any fixed and rigid schema, although typically the data hassomeimplicitstructure. While thelack offixedschemamakesextracting ...