Programs with Lists are Counter Automata

We have shown that the fraction of star-forming galaxies depends strongly on the local density, measured on scales
1 Mpc, and that this correlation is approximately independent of

To test the performance of this approach, in a second part of the study a synthetic traveltime data set is obtained by tracing wave fronts through a mantle structure with known

From a theoretical view point, we prove that many known semilinear subclasses of counter automata are flat: reversal bounded counter ma- chines, lossy vector addition systems

In a similar way we prove that for each ergodic set of this AM C there is a constant d such that, independent of which state the automaton A is in, reading ξ symbols from the

The C++ language files contain the definition of the stochastic types on which the control of accuracy can be performed, CADNA C specific functions (for instance to enable or

The key points in this respect is that we provide a shallow embedding of a pure functional parallel programming library in Coq; that one can program and verify algorithmic skeletons

There are several defined abstractions to prove specifications on structured unbounded data and the main focus has been on arrays. In Section 3.2 we transformed arrays to functions

The main objective of this paper is not to provide a new model for computing over infinite structures, but to present a methodology, based on unfold/fold transformation rules,