Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
LISP
2008
101views more  LISP 2008»
11 years 11 months ago
Flow-sensitive type systems and the ambient calculus
The Ambient Calculus was developed by Cardelli and Gordon as a formal framework to study issues of mobility and migrant code. Numerous analyses have been developed for numerous va...
Torben Amtoft
LISP
2008
64views more  LISP 2008»
11 years 11 months ago
Nesting forward-mode AD in a functional framework
Abstract. We discuss the implications of the desire to augment a functionalprogramming language with a derivative-taking operator using forward-mode automatic differentiation (AD)....
Jeffrey Mark Siskind, Barak A. Pearlmutter
LISP
2008
104views more  LISP 2008»
11 years 11 months ago
Flattening tuples in an SSA intermediate representation
For functional programs, unboxing aggregate data structures such as tuples removes memory indirections and frees dead components of the decoupled structures. To explore the consequ...
Lukasz Ziarek, Stephen Weeks, Suresh Jagannathan
LISP
2008
154views more  LISP 2008»
11 years 11 months ago
Types and trace effects for object orientation
Trace effects are statically generated program abstractions, that can be model checked for verification of assertions in a temporal program logic. In this paper we develop a type a...
Christian Skalka
LISP
2008
104views more  LISP 2008»
11 years 11 months ago
On the implementation of automatic differentiation tools
Automatic differentiation is a semantic transformation that applies the rules of differential calculus to source code. It thus transforms a computer program that computes a mathema...
Christian H. Bischof, Paul D. Hovland, Boyana Norr...
LISP
2008
165views more  LISP 2008»
11 years 11 months ago
Adapting functional programs to higher order logic
Higher-order logic proof systems combine functional programming with logic, providing functional programmers with a comfortable setting for the formalization of programs, specifica...
Scott Owens, Konrad Slind
LISP
2008
96views more  LISP 2008»
11 years 11 months ago
Dynamic slicing of lazy functional programs based on redex trails
Abstract. Tracing computations is a widely used methodology for program debugging. Lazy languages, however, pose new demands on tracing techniques because following the actual trac...
Claudio Ochoa, Josep Silva, Germán Vidal
LISP
2008
72views more  LISP 2008»
11 years 11 months ago
Imperative-program transformation by instrumented-interpreter specialization
We describe how to implement strength reduction, loop-invariant code motion and loop quasi-invariant code motion by specializing instrumented interpreters. To curb code duplication...
Søren Debois
LISP
2008
70views more  LISP 2008»
11 years 11 months ago
Program transformations for light-weight CPU accounting and control in the Java virtual machine
This article constitutes a thorough presentation of an original scheme for portable CPU accounting and control in Java, which is based on program transformation techniques at the ...
Jarle Hulaas, Walter Binder
LISP
2008
97views more  LISP 2008»
11 years 11 months ago
Efficient and flexible access control via Jones-optimal logic program specialisation
We describe the use of a flexible meta-interpreter for performing access control checks on deductive databases. The meta-program is implemented in Prolog and takes as input a datab...
Steve Barker, Michael Leuschel, Mauricio Varea
books