4716 search results - page 273 / 944 » Tangible functional programming |
166
click to vote
POPL
1995
ACM
15 years 10 months ago
1995
ACM
The goal of program transformation is to improve efficiency while preserving meaning. One of the best known transformation techniques is Burstall and Darlington’s unfold-fold me...
170
click to vote
ICFP
2010
ACM
15 years 7 months ago
2010
ACM
Type classes have found a wide variety of uses in Haskell programs, from simple overloading of operators (such as equality or ordering) to complex invariants used to implement typ...
183
click to vote
BMCBI
2010
15 years 6 months ago
2010
Background: The protein folding problem remains one of the most challenging open problems in computational biology. Simplified models in terms of lattice structure and energy func...
182
click to vote
ICFP
2008
ACM
16 years 6 months ago
2008
ACM
We describe an axiomatic extension to the Coq proof assistant, that supports writing, reasoning about, and extracting higher-order, dependently-typed programs with side-effects. C...
135
click to vote
SPAA
2004
ACM
16 years 22 hour ago
2004
ACM
A key capability of data-race detectors is to determine whether one thread executes logically in parallel with another or whether the threads must operate in series. This paper pr...