Sciweavers

2777 search results - page 262 / 556
» Example centric programming
Sort
View
120
Voted
CORR
2010
Springer
118views Education» more  CORR 2010»
15 years 3 months ago
alphaCertified: certifying solutions to polynomial systems
Smale's -theory uses estimates related to the convergence of Newton's method to give criteria implying that Newton iterations will converge quadratically to solutions to ...
Jonathan D. Hauenstein, Frank Sottile
120
Voted
ENTCS
2008
116views more  ENTCS 2008»
15 years 3 months ago
A Bidirectional Refinement Type System for LF
We present a system of refinement types for LF in the style of recent formulations where only canonical forms are well-typed. Both the usual LF rules and the rules for type refine...
William Lovas, Frank Pfenning
134
Voted
IJAR
2008
106views more  IJAR 2008»
15 years 3 months ago
Probabilistic logic with independence
This paper investigates probabilistic logics endowed with independence relations. We review propositional probabilistic languages without and with independence. We then consider g...
Fabio Gagliardi Cozman, Cassio Polpo de Campos, Jo...
122
Voted
ENTCS
2007
104views more  ENTCS 2007»
15 years 3 months ago
Amb Breaks Well-Pointedness, Ground Amb Doesn't
McCarthy’s amb operator has no known denotational semantics, and its basic operational properties - the context lemma, the compatibility of refinement similarity and convex bis...
Paul Blain Levy
115
Voted
MSCS
2006
89views more  MSCS 2006»
15 years 3 months ago
Quantum weakest preconditions
We develop a notion of predicate transformer and, in particular, the weakest precondition, appropriate for quantum computation. We show that there is a Stone-type duality between ...
Ellie D'Hondt, Prakash Panangaden