Sciweavers

439 search results - page 30 / 88
» Type invariants for Haskell
Sort
View
PEPM
2010
ACM
14 years 4 months ago
Optimizing generics is easy!
Datatype-generic programming increases program reliability by reducing code duplication and enhancing reusability and modularity. Several generic programming libraries for Haskell...
José Pedro Magalhães, Stefan Holderm...
IFL
1997
Springer
153views Formal Methods» more  IFL 1997»
13 years 12 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
FUIN
2006
77views more  FUIN 2006»
13 years 7 months ago
The Impact of seq on Free Theorems-Based Program Transformations
Parametric polymorphism constrains the behavior of pure functional programs in a way that allows the derivation of interesting theorems about them solely from their types, i.e., vi...
Patricia Johann, Janis Voigtländer
ICCV
1998
IEEE
14 years 9 months ago
Wide Baseline Stereo Matching
`Invariant regions' are image patches that automatically deform with changing viewpoint as to keep on covering identical physical parts of a scene. Such regions are then desc...
Philip Pritchett, Andrew Zisserman
JSC
2010
100views more  JSC 2010»
13 years 2 months ago
An invariant-based approach to the verification of asynchronous parameterized networks
A uniform verification problem for parameterized systems is to determine whether a temporal property is satisfied for every instance of the system which is composed of an arbitrar...
Igor V. Konnov, Vladimir A. Zakharov