Sciweavers

669 search results - page 72 / 134
» Haskell program coverage
Sort
View
KBSE
2007
IEEE
14 years 3 months ago
Evacon: a framework for integrating evolutionary and concolic testing for object-oriented programs
Achieving high structural coverage such as branch coverage in objectoriented programs is an important and yet challenging goal due to two main challenges. First, some branches inv...
Kobi Inkumsah, Tao Xie
ICFP
2005
ACM
14 years 9 months ago
Monadic augment and generalised short cut fusion
Monads are commonplace programming devices that are used to uniformly structure computations with effects such as state, exceptions, and I/O. This paper further develops the monad...
Neil Ghani, Patricia Johann, Tarmo Uustalu, Varmo ...
SIGCSE
2008
ACM
108views Education» more  SIGCSE 2008»
13 years 8 months ago
From sockets and RMI to web services
Traditional coverage of network programming techniques in a computer networking course addresses sockets, remote procedure call, and object-oriented remote procedure call. We prop...
Mark A. Holliday, J. Traynham Houston, E. Matthew ...
ICFP
2007
ACM
14 years 9 months ago
Faster laziness using dynamic pointer tagging
In the light of evidence that Haskell programs compiled by GHC exhibit large numbers of mispredicted branches on modern processors, we re-examine the "tagless" aspect of...
Simon Marlow, Alexey Rodriguez Yakushev, Simon L. ...
ICFP
2006
ACM
14 years 9 months ago
A pattern for almost compositional functions
This paper introduces a pattern for almost compositional functions over recursive data types, and over families of mutually recursive data types. Here "almost compositional&q...
Aarne Ranta, Björn Bringert