A Computational Interpretation of Forcing in Type Theory

@inproceedings{Coquand2012ACI,
  title={A Computational Interpretation of Forcing in Type Theory},
  author={Thierry Coquand and Guilhem Jaber},
  booktitle={Epistemology versus Ontology},
  year={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. 

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 15 references

The Essence of Functional Programming

POPL • 1992
View 3 Excerpts
Highly Influenced

A Note on Forcing and Type Theory

Fundam. Inform. • 2010
View 3 Excerpts

Infinite sets that admit fast exhaustive search

22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007) • 2007
View 1 Excerpt

The discovery of forcing

P. Cohen
Rocky Mountain J. Math • 2002

An intuitionistic theory of types in Twenty-Five Years of Type

P. Martin-Löf
1998
View 2 Excerpts

and D

A. S. Troelstr
van Dalen. Constructivism in Mathematics, vol. II. NorthHolland, Amsterdam, • 1988
View 1 Excerpt

Similar Papers

Loading similar papers…