Skip to main content
Article thumbnail
Location of Repository

Program Extraction in Church’s Simple Theory of Types with Applications to Computable Analysis

By Ulrich Berger

Abstract

1 / 36A logical approach to computable analysis In this talk I present a logical approach to computable analysis based on program extraction from proofs. I’ll explain the basic principle, give some examples and highlight aspects that might make this approach interesting to people working in computable analysis. The main attraction of the approach is, in my opinion, the fact that one can work directly with abstract mathematical objects without having to construct particular representations. The work reported in this talk is joint with Monika Seisenberge

Topics: Topics, computable analysis, domain theory, topology
Year: 2013
OAI identifier: oai:CiteSeerX.psu:10.1.1.352.9614
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www-compsci.swan.ac.uk/... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.