A computational interpretation of forcing in type theory
Book chapter, 2012
In a previous work, we showed the uniform continuity of definable functionals in intuitionistic type theory as an application of forcing with dependent types. The argument was constructive, and so contains implicitly an algorithm which computes a witness that a given functional is uniformly continuous. We present here such an algorithm, which provides a possible computational interpretation of forcing.
Author
Thierry Coquand
University of Gothenburg
G. Jaber
Ecole des Mines de Nantes
Epistemology versus Ontology: Essays on the Philosophy and Foundations of Mathematics in Honour of per Martin-Löf
203-213
Subject Categories
Computer and Information Science
DOI
10.1007/978-94-007-4435-6_10