60 search results - page 5 / 12 » Recursive Definitions of Monadic Functions |
158
click to vote
POPL
2010
ACM
16 years 3 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...
143
click to vote
BIRTHDAY
2006
Springer
15 years 10 months ago
2006
Springer
This paper is a contribution to the study of uniformity conditions for endofunctors on sets initiated in Aczel [1] and pursued later in other works such as Turi [17]. The main res...
164
click to vote
LICS
1999
IEEE
15 years 10 months ago
1999
IEEE
This paper extends the termination proof techniques based on reduction orderings to a higher-order setting, by adapting the recursive path ordering definition to terms of a typed ...
180
click to vote
EVOW
1994
Springer
15 years 10 months ago
1994
Springer
The genetic programming (GP) paradigm is a new approach to inductively forming programs that describe a particular problem. The use of natural selection based on a fitness ]unction...
166
click to vote
ICFP
2005
ACM
16 years 6 months ago
2005
ACM
The `Scrap your boilerplate' approach to generic programming allows the programmer to write generic functions that can traverse arbitrary data structures, and yet have type-s...