Sciweavers

1805 search results - page 32 / 361
» Functional programming with structured graphs
Sort
View
LICS
2009
IEEE
14 years 2 months ago
Pointer Programs and Undirected Reachability
Pointer programs are a model of structured computation within logspace. They capture the common description of logspace algorithms as programs that take as input some structured d...
Martin Hofmann, Ulrich Schöpp
HIPS
1998
IEEE
13 years 12 months ago
A Graph-Based Framework for the Definition of Tools Dealing with Sparse and Irregular Distributed Data Structures
Industrial applications use specific problem-oriented implementations of large sparse and irregular data structures. Hence there is a need for tools that make it possible for deve...
Jean-Michel Lépine, Serge Chaumette, Frank ...
APLAS
2010
ACM
13 years 6 months ago
Type Inference for Sublinear Space Functional Programming
We consider programming language aspects of algorithms that operate on data too large to fit into memory. In previous work we have introduced IntML, a functional programming langu...
Ugo Dal Lago, Ulrich Schöpp
SIGSOFT
2003
ACM
14 years 8 months ago
Context-sensitive slicing of concurrent programs
Program slicing is a technique to identify statements that may influence the computations at other statements. Precise slicing has been shown to be undecidable for concurrent prog...
Jens Krinke
CEC
2009
IEEE
14 years 2 months ago
Representation and structural biases in CGP
— An evolutionary algorithm automatically discovers suitable solutions to a problem, which may lie anywhere in a large search space of candidate solutions. In the case of Genetic...
Andrew J. Payne, Susan Stepney