Author of the publication

Computational adequacy for recursive types in models of intuitionistic set theory.

. Annals of Pure and Applied Logic, 130 (1): 207-275 (2004)Papers presented at the 2002 IEEE Symposium on Logic in Computer Science (LICS).
DOI: https://doi.org/10.1016/j.apal.2003.12.005

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

Two constructive embedding-extension theorems with applications to continuity principles and to Banach-Mazur computability., and . Math. Log. Q., 50 (4-5): 351-369 (2004)Relational Parametricity for Computational Effects, and . Logical Methods in Computer Science, (2009)A Proof System for Compositional Verification of Probabilistic Concurrent Processes., and . FoSSaCS, volume 7794 of Lecture Notes in Computer Science, page 161-176. Springer, (2013)Computational adequacy for recursive types in models of intuitionistic set theory.. Annals of Pure and Applied Logic, 130 (1): 207-275 (2004)Papers presented at the 2002 IEEE Symposium on Logic in Computer Science (LICS).Coalgebraic semantics for timed processes., , and . Inf. Comput., 204 (4): 588-609 (2006)Behavioural Equivalence via Modalities for Algebraic Effects., and . ESOP, volume 10801 of Lecture Notes in Computer Science, page 300-326. Springer, (2018)Category-theoretic Structure for Independence and Conditional Independence.. MFPS, volume 341 of Electronic Notes in Theoretical Computer Science, page 281-297. Elsevier, (2018)Łukasiewicz μ-calculus., and . Fundam. Informaticae, 150 (3-4): 317-346 (2017)Probability Sheaves and the Giry Monad.. CALCO, volume 72 of LIPIcs, page 1:1-1:6. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Complete Sequent Calculi for Induction and Infinite Descent, and . (2007)