Sciweavers

4743 search results - page 93 / 949
» Introduction to Functional Programming
Sort
View
ICSE
2007
IEEE-ACM
14 years 10 months ago
Path-Sensitive Inference of Function Precedence Protocols
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...
Murali Krishna Ramanathan, Ananth Grama, Suresh Ja...
FPCA
1993
14 years 2 months ago
Benchmarking Implementations of Lazy Functional Languages
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...
Pieter H. Hartel, Koen Langendoen
GECCO
2011
Springer
276views Optimization» more  GECCO 2011»
13 years 1 months ago
Evolution of reward functions for reinforcement learning
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...
Scott Niekum, Lee Spector, Andrew G. Barto
CSMR
1999
IEEE
14 years 2 months ago
Impact of Function Pointers on the Call Graph
Maintenance activities are made more difficult when pointers are heavily used in source code: the programmer needs to build a mental model of memory locations and of the way they ...
Giuliano Antoniol, F. Calzolari, Paolo Tonella
MICS
2008
108views more  MICS 2008»
13 years 10 months ago
Efficient Intensional Implementation for Lazy Functional Languages
The intensional transformation is a technique that can be used in order to eliminate higher-order functions from a functional program by introducing appropriate context manipulatio...
Angelos Charalambidis, Athanasios Grivas, Nikolaos...