Sciweavers

PADL
2010
Springer
14 years 4 months ago
Automating Mathematical Program Transformations
Abstract. Mathematical programs (MPs) are a class of constrained optimization problems that include linear, mixed-integer, and disjunctive programs. Strategies for solving MPs rely...
Ashish Agarwal, Sooraj Bhat, Alexander Gray, Ignac...
PADL
2010
Springer
14 years 4 months ago
ActionScript In-Lined Reference Monitoring in Prolog
Abstract. A Prolog implementation of an In-lined Reference Monitoring system prototype for Adobe ActionScript Bytecode programs is presented. Prolog provides an elegant framework f...
Meera Sridhar, Kevin W. Hamlen
PADL
2010
Springer
14 years 4 months ago
Prospective Storytelling Agents
Abstract. Prospective Logic Programming is a declarative framework supporting the specification of autonomous agents capable of anticipating and reasoning about hypothetical futur...
Gonçalo Lopes, Luís Moniz Pereira
PADL
2010
Springer
14 years 4 months ago
Static Detection of Race Conditions in Erlang
Abstract. We address the problem of detecting some commonly occurring kinds of race conditions in Erlang programs using static analysis. Our analysis is completely automatic, fast ...
Maria Christakis, Konstantinos F. Sagonas
PADL
2010
Springer
14 years 4 months ago
An Ode to Arrows
Abstract. We study a number of embedded DSLs for autonomous ordinary differential equations (autonomous ODEs) in Haskell. A naive implementation based on the lazy tower of derivat...
Hai Liu, Paul Hudak
PADL
2010
Springer
14 years 4 months ago
Skeleton Composition Using Remote Data
Abstract. Skeletons simplify parallel programming by providing general patterns of parallel computations. When several skeletons are used inside the same program, skeleton composit...
Mischa Dieterle, Thomas Horstmeyer, Rita Loogen
PADL
2010
Springer
14 years 4 months ago
Lazy Explanations for Constraint Propagators
Explanations are a technique for reasoning about constraint propagation, which have been applied in many learning, backjumping and user-interaction algorithms for constraint progra...
Ian P. Gent, Ian Miguel, Neil C. A. Moore
PADL
2010
Springer
14 years 4 months ago
Conversion by Evaluation
Abstract. We show how testing convertibility of two types in dependently typed systems can advantageously be implemented instead untyped normalization by evaluation, thereby reusin...
Mathieu Boespflug