Continuity of Gödel's System T Definable Functionals via Effectful Forcing
暂无分享,去创建一个
[1] Gordon D. Plotkin,et al. Algebraic Operations and Generic Effects , 2003, Appl. Categorical Struct..
[2] John Longley. When is a functional program not a functional program? , 1999, ICFP '99.
[3] Thierry Coquand,et al. A Computational Interpretation of Forcing in Type Theory , 2012, Epistemology versus Ontology.
[4] Thierry Coquand,et al. A Note on Forcing and Type Theory , 2010, Fundam. Informaticae.
[5] Andrej Bauer,et al. Programming with algebraic effects and handlers , 2012, J. Log. Algebraic Methods Program..
[6] Jaap van Oosten,et al. The Univalent Foundations Program. Homotopy Type Theory: Univalent Foundations of Mathematics. http: //homotopytypetheory.org/book, Institute for Advanced Study, 2013, vii + 583 pp , 2014, Bulletin of Symbolic Logic.
[7] P. Aczel,et al. Homotopy Type Theory: Univalent Foundations of Mathematics , 2013 .
[8] Peter Hancock,et al. Interactive Programs in Dependent Type Theory , 2000, CSL.
[9] Program. FOUNDATIONS OF CONSTRUCTIVE MATHEMATICS , 2014 .
[10] Dirk Pattinson,et al. Representations of Stream Processors Using Nested Fixed Points , 2009, Log. Methods Comput. Sci..
[11] A. Troelstra. Metamathematical investigation of intuitionistic arithmetic and analysis , 1973 .
[12] E. Bishop. Foundations of Constructive Analysis , 2012 .
[13] A. Nerode,et al. Review: S. C. Kleene, Recursive Functionals and Quantifiers of Finite Types I , 1962 .
[14] William A. Howard,et al. Ordinal analysis of terms of finite type , 1980, Journal of Symbolic Logic.
[15] Peter Dybjer,et al. Dependent Types at Work , 2009, LerNet ALFA Summer School.
[16] Alexander K. Petrenko,et al. Electronic Notes in Theoretical Computer Science , 2009 .
[17] Martín Hötzel Escardó,et al. A Constructive Model of Uniform Continuity , 2013, TLCA.
[18] J. Davenport. Editor , 1960 .
[19] S. C. Kleene,et al. Recursive functionals and quantifiers of finite types. II , 1959 .