Sciweavers

669 search results - page 89 / 134
» Haskell program coverage
Sort
View
ICFP
1999
ACM
14 years 1 months ago
Type Inference Builds a Short Cut to Deforestation
Deforestation optimises a functional program by transforming it into another one that does not create certain intermediate data structures. Short cut deforestation is a deforestat...
Olaf Chitil
ICFP
1999
ACM
14 years 1 months ago
Relating Typability and Expressiveness in Finite-Rank Intersection Type Systems (Extended Abstract)
d Abstract) Assaf J. Kfoury∗ Boston University http://www.cs.bu.edu/˜kfoury Harry G. Mairson† Brandeis University http://www.cs.brandeis.edu/˜mairson Franklyn A. Turbak‡ We...
Assaf J. Kfoury, Harry G. Mairson, Franklyn A. Tur...
POPL
1995
ACM
14 years 16 days ago
Monad Transformers and Modular Interpreters
We show how a set of building blocks can be used to construct programming language interpreters, and present implementations of such building blocks capable of supporting many com...
Sheng Liang, Paul Hudak, Mark P. Jones
WOTUG
2008
13 years 10 months ago
Representation and Implementation of CSP and VCR Traces
Abstract. Communicating Sequential Processes (CSP) was developed around a formal algebra of processes and a semantics based on traces (and failures and divergences). A trace is a r...
Neil C. C. Brown, Marc L. Smith
ICSE
2008
IEEE-ACM
14 years 9 months ago
Calysto: scalable and precise extended static checking
Automatically detecting bugs in programs has been a long-held goal in software engineering. Many techniques exist, trading-off varying levels of automation, thoroughness of covera...
Domagoj Babic, Alan J. Hu