2015/11/03 by Ulrich Berger, Berger, Ulrich
Computer Science · #Computability, Logic, AI Algorithms #Logic, programming, and type systems #Numerical Methods and Algorithms
paper · doi:10.14279/tuj.eceasst.23.332
openalex publication_date 2024/03/12 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/01
Since the work of Brouwer, Kolmogorov, Goedel, Kleene and many others we know that constructive proofs have computational meaning. In Computer Science this idea is known as the "proofs-as-programs paradigm" or "Curry-Howard correspondence". We present examples from computable analysis showing that this paradigm not only works in principle, but can be used to automatically synthesise practically relevant certified programs.