439 search results - page 21 / 88 » Type invariants for Haskell |
IFL
2005
Springer
14 years 2 months ago
2005
Springer
Polytypic functional programming has the advantage that it can derive code for generic functions automatically. However, it is not clear whether it is useful for anything other tha...
TPHOL
2008
IEEE
14 years 3 months ago
2008
IEEE
We introduce a lightweight approach for reasoning about programs involving imperative data structures using the proof assistant Isabelle/HOL. It is based on shallow embedding of pr...
JCT
2006
13 years 9 months ago
2006
We prove that the Kazhdan-Lusztig polynomials are combinatorial invariants for intervals up to length 8 in Coxeter groups of type A and up to length 6 in Coxeter groups of type B a...
TCS
2010
13 years 7 months ago
2010
This paper presents an embedded security sublanguage for enforcing informationflow policies in the standard Haskell programming language. The sublanguage provides useful informat...
ICPR
2006
IEEE
14 years 10 months ago
2006
IEEE
We present a unified framework for modeling and solving invariant point pattern matching problems. Invariant features are encoded as potentials in a probabilistic graphical model....