Sciweavers

439 search results - page 15 / 88
» Type invariants for Haskell
Sort
View
POPL
2007
ACM
14 years 9 months ago
A concurrent constraint handling rules implementation in Haskell with software transactional memory
Constraint Handling Rules (CHR) is a concurrent committedchoice constraint logic programming language to describe transformations (rewritings) among multi-sets of constraints (ato...
Edmund S. L. Lam, Martin Sulzmann
SIGPLAN
2002
13 years 8 months ago
A rule-based language for programming software updates
We describe the design of a rule-based language for expressing changes to Haskell programs in a systematic and reliable way. The update language essentially offers update commands...
Martin Erwig, Deling Ren
IJCV
2010
170views more  IJCV 2010»
13 years 7 months ago
Implicit Moment Invariants
Abstract The use of traditional moment invariants in object recognition is limited to simple geometric transforms, such as rotation, scaling and affine transformation of the image...
Jan Flusser, Jaroslav Kautsky, Filip Sroubek
FLOPS
2010
Springer
14 years 3 months ago
Code Generation via Higher-Order Rewrite Systems
Abstract. We present the meta-theory behind the code generation facilities of Isabelle/HOL. To bridge the gap between the source (higherorder logic with type classes) and the many ...
Florian Haftmann, Tobias Nipkow
VMCAI
2010
Springer
14 years 6 months ago
Invariant and Type Inference for Matrices
We present a loop property generation method for loops iterating over multi-dimensional arrays. When used on matrices, our method is able to infer their shapes (also called types),...
Thomas A. Henzinger, Thibaud Hottelier, Laura Kov&...