439 search results - page 40 / 88 » Type invariants for Haskell |
SAS
2005
Springer
14 years 1 months ago
2005
Springer
There are many source-level analyses or instrumentation tools that enforce various safety properties. In this paper we present an infrastructure that can be used to check independe...
CSL
2007
Springer
14 years 1 months ago
2007
Springer
Normal form bisimulation is a powerful theory of program equivalence, originally developed to characterize L´evy-Longo tree equivalence and Boehm tree equivalence. It has been ada...
JCT
2011
13 years 2 months ago
2011
We give combinatorial proofs of the formulas for the number of multichains in the k-divisible noncrossing partitions of classical types with certain conditions on the rank and the ...
POPL
1993
ACM
13 years 11 months ago
1993
ACM
e data structures are abstractions of simple records and pointers. They impose a shape invariant, which is verified at compiletime and exploited to automatically generate code fo...
CSL
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Girard’s Geometry of Interaction (GoI) develops a mathematical framework for modelling the dynamics of cut-elimination. We introduce a typed version of GoI, called Mult...