Sciweavers

133 search results - page 10 / 27
» Benchmarking Implementations of Lazy Functional Languages
Sort
View
IFL
2007
Springer
120views Formal Methods» more  IFL 2007»
14 years 1 months ago
Lazy Contract Checking for Immutable Data Structures
Existing contract checkers for data structures force programmers to choose between poor alternatives. Contracts are either built into the functions that construct the data structur...
Robert Bruce Findler, Shu-yu Guo, Anne Rogers
GI
2009
Springer
14 years 9 days ago
Taming Selective Strictness
Abstract: Free theorems establish interesting properties of parametrically polymorphic functions, solely from their types, and serve as a nice proof tool. For pure and lazy functio...
Daniel Seidel, Janis Voigtländer
ICFP
1998
ACM
13 years 12 months ago
Functional Differentiation of Computer Programs
We present a purely functional implementation of the computational differentiation tools — the well known numeric (i.e., not symbolic) techniques which permit one to compute poin...
Jerzy Karczmarczuk
CP
2009
Springer
14 years 2 months ago
Why Cumulative Decomposition Is Not as Bad as It Sounds
Abstract. The global cumulative constraint was proposed for modelling cumulative resources in scheduling problems for finite domain (FD) propagation. Since that time a great deal ...
Andreas Schutt, Thibaut Feydy, Peter J. Stuckey, M...
POS
1998
Springer
13 years 12 months ago
Swizzle Barrier Optimizations for Orthogonal Persistence in Java
Swizzling refers to the translation of object references from an external, persistent format to an internal, transient format used during application execution. Eager swizzling sc...
Kumar Brahnmath, Nathaniel Nystrom, Antony L. Hosk...