Author of the publication

Formalization of Mathematics in Type Theory (Dagstuhl Seminar 18341).

, , , and . Dagstuhl Reports, 8 (8): 130-155 (2018)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Domain Theory in Constructive and Predicative Univalent Foundations., and . CSL, volume 183 of LIPIcs, page 28:1-28:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Hausdorff compactifications of topological function spaces via the theory of continuous lattices.. MFCSIT, volume 40 of Electronic Notes in Theoretical Computer Science, page 161. Elsevier, (2000)Partial Elements and Recursion via Dominances in Univalent Type Theory., and . CSL, volume 82 of LIPIcs, page 21:1-21:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)The Extended Probabilistic Powerdomain Monad over Stably Compact Spaces., , and . TAMC, volume 3959 of Lecture Notes in Computer Science, page 566-575. Springer, (2006)Abstract Datatypes for Real Numbers in Type Theory., and . RTA-TLCA, volume 8560 of Lecture Notes in Computer Science, page 208-223. Springer, (2014)Continuity of Gödel's System T Definable Functionals via Effectful Forcing.. MFPS, volume 298 of Electronic Notes in Theoretical Computer Science, page 119-141. Elsevier, (2013)The Peirce translation., and . Ann. Pure Appl. Log., 163 (6): 681-692 (2012)Recursion and Induction on the Real Line.. Theory and Formal Methods, page 259-282. Imperial College Press, (1994)Operational domain theory and topology of sequential programming languages., and . Inf. Comput., 207 (3): 411-437 (2009)Theory and Practice of Higher-type Computation (Tutorial).. CCA, volume 11 of OASIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany, (2009)