Sciweavers

439 search results - page 28 / 88
» Type invariants for Haskell
Sort
View
ESOP
2006
Springer
13 years 11 months ago
Inference of User-Defined Type Qualifiers and Qualifier Rules
Abstract. In previous work, we described a new approach to supporting userdefined type qualifiers, which augment existing types to specify and check additional properties of intere...
Brian Chin, Shane Markstrum, Todd D. Millstein, Je...
ACTA
2005
101views more  ACTA 2005»
13 years 7 months ago
A general framework for types in graph rewriting
A general framework for typing graph rewriting systems is presented: the idea is to statically derive a type graph from a given graph. In contrast to the original graph, the type g...
Barbara König
ICIP
2000
IEEE
14 years 4 days ago
Adaptive Target Detection Across a Clutter Boundary: GLR and Maximally Invariant Detectors
We present and compare adaptive detection algorithms developed for synthetic aperture radar (SAR) targets in structured clutter, utilizing both generalized likelihood ratio (GLR) ...
Hyung Soo Kim, Alfred O. Hero III
PLDI
1998
ACM
13 years 12 months ago
Eliminating Array Bound Checking Through Dependent Types
We present a type-based approach to eliminating array bound checking and list tag checking by conservatively extending Standard ML with a restricted form of dependent types. This ...
Hongwei Xi, Frank Pfenning
ICFP
2005
ACM
14 years 7 months ago
Scrap your boilerplate with class: extensible generic functions
The `Scrap your boilerplate' approach to generic programming allows the programmer to write generic functions that can traverse arbitrary data structures, and yet have type-s...
Ralf Lämmel, Simon L. Peyton Jones