Sciweavers

669 search results - page 64 / 134
» Haskell program coverage
Sort
View
APLAS
2008
ACM
13 years 11 months ago
Extensional Universal Types for Call-by-Value
Abstract. We propose c2-calculus, which is a second-order polymorphic call-by-value calculus with extensional universal types. Unlike product types or function types in call-by-val...
Kazuyuki Asada
IWMM
2011
Springer
204views Hardware» more  IWMM 2011»
12 years 11 months ago
Multicore garbage collection with local heaps
In a parallel, shared-memory, language with a garbage collected heap, it is desirable for each processor to perform minor garbage collections independently. Although obvious, it i...
Simon Marlow, Simon L. Peyton Jones
AAAI
2007
13 years 11 months ago
Anytime Coordination Using Separable Bilinear Programs
Developing scalable coordination algorithms for multi-agent systems is a hard computational challenge. One useful approach, demonstrated by the Coverage Set Algorithm (CSA), explo...
Marek Petrik, Shlomo Zilberstein
GECCO
2007
Springer
154views Optimization» more  GECCO 2007»
14 years 3 months ago
A multi-objective approach to search-based test data generation
There has been a considerable body of work on search–based test data generation for branch coverage. However, hitherto, there has been no work on multi–objective branch covera...
Kiran Lakhotia, Mark Harman, Phil McMinn
POPL
2003
ACM
14 years 9 months ago
Guarded recursive datatype constructors
We introduce a notion of guarded recursive (g.r.) datatype constructors, generalizing the notion of recursive datatypes in functional programming languages such as ML and Haskell....
Hongwei Xi, Chiyan Chen, Gang Chen