Skip to Main content Skip to Navigation
Conference papers

A Formalization of Polytime Functions

Abstract : We present a deep embedding of Bellantoni and Cook's syntactic characterization of polytime functions. We prove formally that it is correct and complete with respect to the original characterization by Cobham that required a bound to be proved manually. Compared to the paper proof by Bellantoni and Cook, we have been careful in making our proof fully contructive so that we obtain more precise bounding polynomials and more efficient translations between the two characterizations. Another difference is that we consider functions on bitstrings instead of functions on positive integers. This latter change is motivated by the application of our formalization in the context of formal security proofs in cryptography. Based on our core formalization, we have started developing a library of polytime functions that can be reused to build more complex ones.
Document type :
Conference papers
Complete list of metadata
Contributor : Sylvain Heraud Connect in order to contact the contributor
Submitted on : Wednesday, December 21, 2011 - 11:42:02 AM
Last modification on : Thursday, January 7, 2021 - 3:40:05 PM
Long-term archiving on: : Thursday, March 22, 2012 - 2:25:53 AM


Files produced by the author(s)


  • HAL Id : hal-00654217, version 1



Sylvain Heraud, David Nowak. A Formalization of Polytime Functions. ITP 2011, Aug 2011, Nijmegen, Netherlands. ⟨hal-00654217⟩



Record views


Files downloads