Simple Search

Query:

Enter a query and click »Search«...

Format:

Display: entries per page entries

Zbl 1185.68621
Grégoire, Benjamin; Théry, Laurent; Werner, Benjamin
A computational approach to Pocklington certificates in type theory. (English)
[A] Hagiya, Masami (ed.) et al., Functional and logic programming. 8th international symposium, FLOPS 2006, Fuji-Susono, Japan, April 24--26, 2006. Proceedings. Berlin: Springer. Lecture Notes in Computer Science 3945, 97-113 (2006). ISBN 3-540-33438-6/pbk

Summary: Pocklington certificates are known to provide short proofs of primality. We show how to perform this in the framework of formal, mechanically checked, proofs. We present an encoding of certificates for the proof system Coq which yields radically improved performances by relying heavily on computations inside and outside of the system (two-level approach).

MSC 2000:: *68T15 Theorem proving

Comment on this Item PDF MathML XML ASCII DVI PS BibTeX Online Ordering Article

	Scientific prize winners of the ICM 2010
	Overhang
	Lie groups, physics and geometry. An introduction for physicists, engineers and chemists.

Simple Search

Zentralblatt MATH Berlin [Germany]