Skip to main content

A Proof of the S-m-n theorem in Coq

Zammit, Vincent (1997) A Proof of the S-m-n theorem in Coq. Technical report. University of Kent, The University of Kent, Canterbury, Kent, UK (KAR id:21524)

Postscript
Language: English
Download (250kB) Preview
[thumbnail of A_proof_of_the_S-m-n_theorem_in_Coq.ps]
Preview
This file may not be suitable for users of assistive technology.
Request an accessible format
PDF
Language: English
Download (276kB) Preview
[thumbnail of A_proof_of_the_S-m-n_theorem_in_Coq.pdf]
Preview
This file may not be suitable for users of assistive technology.
Request an accessible format

Abstract

This report describes the implementation of a mechanisation of the theory of computation in the Coq proof assistant which leads to a proof of the S<sub>m</sub><sub>n</sub> theorem. This mechanisation is based on a model of computation similar to the partial recursive function model and includes the definition of a computable function, proofs of the computability of a number of functions and the definition of an effective coding from the set of partial recursive functions to natural numbers. This work forms part of a comparative study of the HOL and Coq proof assistants.

Item Type: Monograph (Technical report)
Uncontrolled keywords: Computability, Theorem Proving, Formalized Mathematics
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing
Depositing User: Mark Wheadon
Date Deposited: 25 Aug 2009 17:26 UTC
Last Modified: 16 Feb 2021 12:32 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/21524 (The current URI for this page, for reference purposes)
  • Depositors only (login required):

Downloads

Downloads per month over past year