1390 search results - page 11 / 278 » On the Algebraic Structure of Convergence |
CISST
2003
14 years 10 months ago
2003
An approach to conflation/registration of images that does not depend on identifying common points is being developed. It uses the method of algebraic invariants to provide a comm...
164
Voted
POPL
2008
ACM
15 years 9 months ago
2008
ACM
GADTs are at the cutting edge of functional programming and become more widely used every day. Nevertheless, the semantic foundations underlying GADTs are not well understood. In ...
MLQ
2006
14 years 9 months ago
2006
We show that a Woodin cardinal is necessary for the Extender Algebra to be complete. Our proof is relatively simple and does not use fine structure.
77
Voted
CASC
2009
Springer
15 years 4 months ago
2009
Springer
This work addresses the problem of computing a certified ǫ-approximation of all real roots of a square-free integer polynomial. We proof an upper bound for its bit complexity, b...
TPHOL
1999
IEEE
15 years 1 months ago
1999
IEEE
We present a development of Universal Algebra inside Type Theory, formalized using the proof assistant Coq. We define the notion of a signature and of an algebra over a signature. ...