Sciweavers

1989 search results - page 158 / 398
» Set functions for functional logic programming
Sort
View
TCS
2010
15 years 1 months ago
Alternating states for dual nondeterminism in imperative programming
The refinement calculus of Back, Morgan, Morris, and others is based on monotone predicate transformers (weakest preconditions) where conjunctions stand for demonic choices betwee...
Wim H. Hesselink
175
Voted
ESOP
2000
Springer
15 years 7 months ago
Compile-Time Debugging of C Programs Working on Trees
We exhibit a technique for automatically verifying the safety of simple C programs working on tree-shaped data structures. We do not consider the complete behavior of programs, but...
Jacob Elgaard, Anders Møller, Michael I. Sc...
249
Voted
POPL
2004
ACM
16 years 3 months ago
Polymorphic typed defunctionalization
Defunctionalization is a program transformation that aims to turn a higher-order functional program into a first-order one, that is, to eliminate the use of functions as first-cla...
François Pottier, Nadji Gauthier
EUROGP
2009
Springer
138views Optimization» more  EUROGP 2009»
15 years 10 months ago
Self Modifying Cartesian Genetic Programming: Fibonacci, Squares, Regression and Summing
Self Modifying CGP (SMCGP) is a developmental form of Cartesian Genetic Programming(CGP). It is able to modify its own phenotype during execution of the evolved program. This is do...
Simon Harding, Julian Francis Miller, Wolfgang Ban...
POPL
2008
ACM
16 years 3 months ago
Imperative self-adjusting computation
Self-adjusting computation enables writing programs that can automatically and efficiently respond to changes to their data (e.g., inputs). The idea behind the approach is to stor...
Umut A. Acar, Amal Ahmed, Matthias Blume