4757 search results - page 104 / 952 » Monads for Functional Programming |
143
click to vote
LICS
2010
IEEE
15 years 28 days ago
2010
IEEE
Alternating timed automata are a powerful extension of classical Alur-Dill timed automata that are closed under all Boolean operations. They have played a key role, among others, ...
122
click to vote
ICA3PP
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. Program behaviors reveal that programs have different sources requirement at different phases, even at continuous clocks. It is not a reasonable way to run different prog...
96
Voted
ICSE
2007
IEEE-ACM
16 years 2 months ago
2007
IEEE-ACM
Function precedence protocols define ordering relations among function calls in a program. In some instances, precedence protocols are well-understood (e.g., a call to pthread mut...
136
click to vote
FPCA
1993
15 years 6 months ago
1993
Five implementations of di erent lazy functional languages are compared using a common benchmark of a dozen medium size programs. The benchmarking procedure has been designed such...
195
click to vote
GECCO
2011
Springer
14 years 6 months ago
2011
Springer
The reward functions that drive reinforcement learning systems are generally derived directly from the descriptions of the problems that the systems are being used to solve. In so...