60 search results - page 5 / 12 » Recursive Definitions of Monadic Functions |
POPL
2010
ACM
15 years 7 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...
68
Voted
BIRTHDAY
2006
Springer
15 years 1 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...
LICS
1999
IEEE
15 years 2 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 ...
EVOW
1994
Springer
15 years 1 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...
ICFP
2005
ACM
15 years 9 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...