Sciweavers

669 search results - page 44 / 134
» Haskell program coverage
Sort
View
ICFP
2002
ACM
14 years 8 months ago
Monads for incremental computing
This paper presents a monadic approach to incremental computation, suitable for purely functional languages such as Haskell. A program that uses incremental computation is able to...
Magnus Carlsson
IFL
1997
Springer
153views Formal Methods» more  IFL 1997»
14 years 1 months ago
Common Subexpressions Are Uncommon in Lazy Functional Languages
Common subexpression elimination is a well-known compiler optimisation that saves time by avoiding the repetition of the same computation. In lazy functional languages, referential...
Olaf Chitil
ICFP
2012
ACM
11 years 11 months ago
Addressing covert termination and timing channels in concurrent information flow systems
When termination of a program is observable by an adversary, confidential information may be leaked by terminating accordingly. While this termination covert channel has limited ...
Deian Stefan, Alejandro Russo, Pablo Buiras, Amit ...
ICFP
2009
ACM
14 years 9 months ago
Complete and decidable type inference for GADTs
GADTs have proven to be an invaluable language extension, a.o. for ensuring data invariants and program correctness. Unfortunately, they pose a tough problem for type inference: w...
Tom Schrijvers, Simon L. Peyton Jones, Martin Sulz...
PADL
2004
Springer
14 years 2 months ago
An Implementation of Session Types
Abstract. A session type is an abstraction of a set of sequences of heterogeneous values sent and received over a communication channel. Session types can be used for specifying st...
Matthias Neubauer, Peter Thiemann