Sciweavers

923 search results - page 31 / 185
» On a generalization of Stickelberger's Theorem
Sort
View
TYPES
1994
Springer
13 years 11 months ago
A Concrete Final Coalgebra Theorem for ZF Set Theory
A special final coalgebra theorem, in the style of Aczel's [2], is proved within standard Zermelo-Fraenkel set theory. Aczel's AntiFoundation Axiom is replaced by a varia...
Lawrence C. Paulson
CORR
2008
Springer
129views Education» more  CORR 2008»
13 years 7 months ago
A polytime proof of correctness of the Rabin-Miller algorithm from Fermat's little theorem
Although a deterministic polytime algorithm for primality testing is now known ([4]), the Rabin-Miller randomized test of primality continues being the most efficient and widely u...
Grzegorz Herman, Michael Soltys
ICFP
2005
ACM
14 years 7 months ago
Combining programming with theorem proving
Applied Type System (ATS) is recently proposed as a framework for designing and formalizing (advanced) type systems in support of practical programming. In ATS, the definition of ...
Chiyan Chen, Hongwei Xi
EVOW
2008
Springer
13 years 9 months ago
A Study of Some Implications of the No Free Lunch Theorem
We introduce the concept of "minimal" search algorithm for a set of functions to optimize. We investigate the structure of closed under permutation (c.u.p.) sets and we c...
Andrea Valsecchi, Leonardo Vanneschi
ECOOP
2006
Springer
13 years 11 months ago
Variance and Generalized Constraints for C# Generics
Abstract. Generic types in C behave invariantly with respect to subtyping. We propose a system of type-safe variance for C that supports the declaration of covariant and contravari...
Burak Emir, Andrew Kennedy, Claudio V. Russo, Dach...