Sciweavers

2607 search results - page 185 / 522
» Complete Functional Synthesis
Sort
View
MSCS
2008
87views more  MSCS 2008»
15 years 4 months ago
Coercions in a polymorphic type system
The idea of coercive subtyping, a theory of abbreviation for dependent type theories, is incorporated into the polymorphic type system in functional programming languages. The tra...
Zhaohui Luo
ADCM
2004
58views more  ADCM 2004»
15 years 3 months ago
Classification of Bivariate Configurations with Simple Lagrange Interpolation Formulae
In 1977 Chung and Yao introduced a geometric characterization in multivariate interpolation in order to identify distributions of points such that the Lagrange functions are produc...
Jesús M. Carnicer, Mariano Gasca
TIFS
2010
120views more  TIFS 2010»
14 years 10 months ago
Gibbs Construction in Steganography
Abstract--We make a connection between steganography design by minimizing embedding distortion and statistical physics. The unique aspect of this work and one that distinguishes it...
Tomás Filler, Jessica J. Fridrich
LORI
2009
Springer
15 years 10 months ago
A General Family of Preferential Belief Removal Operators
Most belief change operators in the AGM tradition assume an underlying plausibility ordering over the possible worlds which is transitive and complete. A unifying structure for the...
Richard Booth, Thomas Meyer, Chattrakul Sombatthee...
CAV
1998
Springer
108views Hardware» more  CAV 1998»
15 years 8 months ago
Decomposing the Proof of Correctness of pipelined Microprocessors
We present a systematic approach to decompose and incrementally build the proof of correctness of pipelined microprocessors. The central idea is to construct the abstraction funct...
Ravi Hosabettu, Mandayam K. Srivas, Ganesh Gopalak...