We propose a new method to control memory resources by static analysis. For this, we introduce the notion of sup-interpretation which bounds from above the size of function outputs...
Abstract. We present an algorithm for inverse computation in a rstorder functional language based on the notion of a perfect process tree. The Universal Resolving Algorithm (URA) i...
Abstract. We extend the termination proof methods based on reduction orderings to higher-order rewriting systems `a la Nipkow using higher-order pattern matching for firing rules,...
This paper presents a MapReduce algorithm for computing pairwise document similarity in large document collections. MapReduce is an attractive framework because it allows us to de...
The so called MSO-problem, – a simple superposition of two or more sinusoidal waves –, has recently been discussed as a benchmark problem for reservoir computing and was shown ...