Sciweavers

191 search results - page 4 / 39
» Generating Heap-Bounded Programs in a Functional Setting
Sort
View
FPCA
1993
13 years 11 months ago
Benchmarking Implementations of Lazy Functional Languages
Five implementations of di erent lazy functional languages are compared using a common benchmark of a dozen medium size programs. The benchmarking procedure has been designed such...
Pieter H. Hartel, Koen Langendoen
ENTCS
2006
113views more  ENTCS 2006»
13 years 7 months ago
Concurrent Java Test Generation as a Search Problem
A Random test generator generates executable tests together with their expected results. In the form of a noise-maker, it seeds the program with conditional scheduling primitives ...
Yaniv Eytani
AUTOMATICA
2008
126views more  AUTOMATICA 2008»
13 years 7 months ago
Local stability analysis using simulations and sum-of-squares programming
The problem of computing bounds on the region-of-attraction for systems with polynomial vector fields is considered. Invariant subsets of the region-of-attraction are characterize...
Ufuk Topcu, Andrew K. Packard, Peter Seiler
CORR
2008
Springer
103views Education» more  CORR 2008»
13 years 7 months ago
Executable Set Theory and Arithmetic Encodings in Prolog
The paper is organized as a self-contained literate Prolog program that implements elements of an executable finite set theory with focus on combinatorial generation and arithmetic...
Paul Tarau
CASCON
1996
89views Education» more  CASCON 1996»
13 years 9 months ago
A functional intermediate form for diverse source languages
This paper describes the use of WatIF, a simple compiler intermediate form based on the -calculus, for writing compiler front-ends for a wide range of programming languages. Somew...
David V. Mason