A Computational Approach to Pocklington Certificates in Type Theory

From MaRDI portal

Revision as of 19:08, 4 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3434628

Jump to:navigation, search

DOI10.1007/11737414_8zbMath1185.68621OpenAlexW186686109MaRDI QIDQ3434628

Laurent Théry, Benjamin Grégoire, Benjamin Werner

Publication date: 2 May 2007

Published in: Functional and Logic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11737414_8

Mathematics Subject Classification ID

Related Items (5)

Formal proofs of hypergeometric sums. Dedicated to the memory of Andrzej Trybulec ⋮ Unnamed Item ⋮ Certifying compilers using higher-order theorem provers as certificate checkers ⋮ Proving Bounds on Real-Valued Functions with Computations ⋮ View of Computer Algebra Data from Coq

Uses Software

Coq

This page was built for publication: A Computational Approach to Pocklington Certificates in Type Theory

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3434628&oldid=16739981"