Sciweavers

38 search results - page 3 / 8
» lisp 2006
Sort
View
LISP
2002
81views more  LISP 2002»
13 years 4 months ago
Linear Continuation-Passing
Abstract. Continuations can be used to explain a wide variety of control behaviours, including calling/returning (procedures), raising/handling (exceptions), labelled jumping (goto...
Josh Berdine, Peter W. O'Hearn, Uday S. Reddy, Hay...
LISP
2002
80views more  LISP 2002»
13 years 4 months ago
Comparing Control Constructs by Double-Barrelled CPS
We investigate call-by-value continuation-passing style transforms that continuations. Altering a single variable in the translation of -abstraction gives rise to different control...
Hayo Thielecke
GECCO
2006
Springer
144views Optimization» more  GECCO 2006»
13 years 8 months ago
When lisp is faster than C
This paper compares the performance of the program evaluation phase of genetic programming using C and Common Lisp. A simple experiment is conducted, and the conclusion is that ge...
Børge Svingen
LISP
2006
91views more  LISP 2006»
13 years 4 months ago
Polymorphic typed defunctionalization and concretization
Abstract. Defunctionalization is a program transformation that eliminates functions as first-class values. We show that defunctionalization can be viewed as a type-preserving trans...
François Pottier, Nadji Gauthier
LISP
2006
117views more  LISP 2006»
13 years 4 months ago
About permutation algebras, (pre)sheaves and named sets
In this paper we survey some well-known approaches proposed as general models for calculi dealing with names (like for example process calculi with name-passing). We focus on (pre)...
Fabio Gadducci, Marino Miculan, Ugo Montanari