Sciweavers

3591 search results - page 240 / 719
» Typing linear constraints
Sort
View
CADE
2003
Springer
16 years 7 months ago
Optimizing Higher-Order Pattern Unification
Abstract. We present an abstract view of existential variables in a dependently typed lambda-calculus based on modal type theory. This allows us to justify optimizations to pattern...
Brigitte Pientka, Frank Pfenning
TLCA
2005
Springer
16 years 21 days ago
A Lambda Calculus for Quantum Computation with Classical Control
The objective of this paper is to develop a functional programming language for quantum computers. We develop a lambda calculus for the classical control model, following the firs...
Peter Selinger, Benoît Valiron
SIAMNUM
2010
87views more  SIAMNUM 2010»
15 years 1 months ago
A Note on the Computation of All Zeros of Simple Quaternionic Polynomials
Polynomials with quaternionic coefficients located on only one side of the powers (we call them simple polynomials) may have two different types of zeros: isolated and spherical ze...
Drahoslava Janovská, Gerhard Opfer
DCC
2005
IEEE
16 years 6 months ago
Towards Practical Minimum-Entropy Universal Decoding
Minimum-entropy decoding is a universal decoding algorithm used in decoding block compression of discrete memoryless sources as well as block transmission of information across di...
Todd P. Coleman, Muriel Médard, Michelle Ef...
BIRTHDAY
2003
Springer
16 years 13 days ago
Fair Equivalence Relations
Equivalence between designs is a fundamental notion in verification. The linear and branching approaches to verification induce different notions of equivalence. When the designs...
Orna Kupferman, Nir Piterman, Moshe Y. Vardi