325 search results - page 22 / 65 » Proofs of Restricted Shuffles |
GI
2009
Springer
14 years 2 months ago
2009
Springer
Abstract: Free theorems establish interesting properties of parametrically polymorphic functions, solely from their types, and serve as a nice proof tool. For pure and lazy functio...
AML
2005
13 years 9 months ago
2005
Abstract. We investigate the theories LA, LAP, LAP of linear algebra, which were originally defined to study the question of whether commutativity of matrix inverses has polysize F...
CG
2004
Springer
13 years 9 months ago
2004
Springer
We provide a formal proof of equivalence between the class of fractals created by Recursive Turtle Programs (RTP) and Iterated Affine Transformations (IAT). We begin by reviewing ...
JLP
2010
13 years 4 months ago
2010
We present a calculus for tracking equality relationships between values through pairs of bytecode programs. The calculus may serve as a certification mechanism for noninterferenc...
NETWORKS
2011
13 years 21 days ago
2011
A graph is terminal ∆ − Y -reducible if, it can be reduced to a distinguished set of terminal vertices by a sequence of series-parallel reductions and ∆−Y -transformations...