136 search results - page 13 / 28 » Proving Properties of Lazy Functional Programs with Sparkle |
COLT
1992
Springer
14 years 3 months ago
1992
Springer
Machine learning of limit programs (i.e., programs allowed finitely many mind changes about their legitimate outputs) for computable functions is studied. Learning of iterated lim...
WFLP
2009
Springer
14 years 5 months ago
2009
Springer
Context-sensitive rewriting is a restriction of rewriting that can be used to elegantly model declarative specification and programming languages such as Maude. Furthermore, it ca...
CADE
2009
Springer
14 years 11 months ago
2009
Springer
Abstract. In functional programming languages the use of infinite structures is common practice. For total correctness of programs dealing with infinite structures one must guarant...
ICALP
2011
Springer
13 years 2 months ago
2011
Springer
Abstract. Congestion games model several interesting applications, including routing and network formation games, and also possess attractive theoretical properties, including the ...
ASIACRYPT
2010
Springer
13 years 9 months ago
2010
Springer
This paper investigates the Random Oracle Model (ROM) feature known as programmability, which allows security reductions in the ROM to dynamically choose the range points of an ide...