Sciweavers

215 search results - page 38 / 43
» Verifying haskell programs using constructive type theory
Sort
View
DCC
2005
IEEE
14 years 6 months ago
Towards Practical Minimum-Entropy Universal Decoding
Minimum-entropy decoding is a universal decoding algorithm used in decoding block compression of discrete memoryless sources as well as block transmission of information across di...
Todd P. Coleman, Muriel Médard, Michelle Ef...
POPL
2006
ACM
14 years 7 months ago
Fast and loose reasoning is morally correct
Functional programmers often reason about programs as if they were written in a total language, expecting the results to carry over to non-total (partial) languages. We justify su...
Nils Anders Danielsson, John Hughes, Patrik Jansso...
POPL
2008
ACM
14 years 7 months ago
Lightweight semiformal time complexity analysis for purely functional data structures
Okasaki and others have demonstrated how purely functional data structures that are efficient even in the presence of persistence can be constructed. To achieve good time bounds e...
Nils Anders Danielsson
ICSE
2004
IEEE-ACM
14 years 7 months ago
Static Checking of Dynamically Generated Queries in Database Applications
Many data-intensive applications dynamically construct queries in response to client requests and execute them. Java servlets, e.g., can create string representations of SQL queri...
Carl Gould, Zhendong Su, Premkumar T. Devanbu
OOPSLA
2005
Springer
14 years 14 days ago
Javari: adding reference immutability to Java
This paper describes a type system that is capable of expressing and enforcing immutability constraints. The speonstraint expressed is that the abstract state of the object to whi...
Matthew S. Tschantz, Michael D. Ernst