Sciweavers

300 search results - page 29 / 60
» Compiling Erlang to Scheme
Sort
View
173
Voted
NJC
2000
169views more  NJC 2000»
15 years 5 months ago
A Type System for Bounded Space and Functional In-Place Update
We show how linear typing can be used to obtain functional programs which modify heap-allocated data structures in place. We present this both as a "design pattern" for ...
Martin Hofmann
HIPEAC
2005
Springer
15 years 11 months ago
A Practical Method for Quickly Evaluating Program Optimizations
This article aims at making iterative optimization practical and usable by speeding up the evaluation of a large range of optimizations. Instead of using a full run to evaluate a s...
Grigori Fursin, Albert Cohen, Michael F. P. O'Boyl...
WIESS
2000
15 years 7 months ago
Dynamic Memory Management with Garbage Collection for Embedded Applications
A software system can be called a safe-system with respect to memory, when it supports only strong-typing and it does not allow for the manual disposal of dynamic memory [2]. The ...
Roberto Brega, Gabrio Rivera
GPCE
2007
Springer
16 years 2 days ago
Debugging macros
Over the past two decades, Scheme macros have evolved into a powerful API for the compiler front-end. Like Lisp macros, their predecessors, Scheme macros expand source programs in...
Ryan Culpepper, Matthias Felleisen
COCO
2005
Springer
92views Algorithms» more  COCO 2005»
15 years 11 months ago
Monotone Circuits for Weighted Threshold Functions
Weighted threshold functions with positive weights are a natural generalization of unweighted threshold functions. These functions are clearly monotone. However, the naive way of ...
Amos Beimel, Enav Weinreb