Sciweavers

5415 search results - page 92 / 1083
» The Implementation of Functional Programming Languages
Sort
View
ICFP
2005
ACM
14 years 9 months ago
Monadic augment and generalised short cut fusion
Monads are commonplace programming devices that are used to uniformly structure computations with effects such as state, exceptions, and I/O. This paper further develops the monad...
Neil Ghani, Patricia Johann, Tarmo Uustalu, Varmo ...
TYPES
2004
Springer
14 years 2 months ago
Tactic-Based Optimized Compilation of Functional Programs
Abstract Within a framework of correct code-generation from HOLspeciļ¬cations, we present a particular instance concerned with the optimized compilation of a lazy language (called...
Thomas Meyer, Burkhart Wolff
LCPC
1999
Springer
14 years 1 months ago
An Empirical Study of Function Pointers Using SPEC Benchmarks
Since the C language imposes little restriction on the use of function pointers, the task of call graph construction for a C program is far more di cult than what the algorithms d...
Ben-Chung Cheng, Wen-mei W. Hwu
GECCO
2006
Springer
161views Optimization» more  GECCO 2006»
14 years 26 days ago
The LEM3 implementation of learnable evolution model and its testing on complex function optimization problems
1 Learnable Evolution Model (LEM) is a form of non-Darwinian evolutionary computation that employs machine learning to guide evolutionary processes. Its main novelty are new type o...
Janusz Wojtusiak, Ryszard S. Michalski
WCRE
2003
IEEE
14 years 2 months ago
RegReg: a Lightweight Generator of Robust Parsers for Irregular Languages
In reverse engineering, parsing may be partially done to extract lightweight source models. Parsing code containing preprocessing directives, syntactical errors and embedded langu...
Mario Latendresse