Wydział Matematyki, Informatyki i Mechaniki Uniwersytetu Warszawskiego
Publikacje
Paweł Urzyczyn
2016
- Aleksy Andrzej Schubert, Paweł Urzyczyn i Daria Monika Walukiewicz-Chrząszcz, How Hard Is Positive Quantification?, Acm Transactions On Computational Logic 17 (4) 2016, s. 30.zobacz w PBN
- Paweł Urzyczyn, Intuitionistic Games: Determinacy, Completeness, and Normalization, Studia Logica 104 (5) 2016, s. 957–1001.zobacz w PBN
- Aleksy Andrzej Schubert, Paweł Urzyczyn i Konrad Zdanowski, On the Mints Hierarchy in First-Order Intuitionistic Logic, Logical Methods In Computer Science 12 (4) 2016, s. 1–25.zobacz w PBN
2015
- Aleksy Andrzej Schubert, Paweł Urzyczyn i Konrad Zdanowski, On the Mints Hierarchy in First-Order Intuitionistic Logic, w: Foundations of Software Science and Computation Structures 18th International Conference, FOSSACS 2015, Springer, 2015, s. 451–465.zobacz w PBN
- Aleksy Andrzej Schubert, Paweł Urzyczyn i Daria Monika Walukiewicz-Chrząszcz, Restricted Positive Quantification Is Not Elementary, w: 20th International Conference on Types for Proofs and Programs, TYPES 2014, May 12-15, 2014, Paris, France, Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Dagstuhl, Niemcy 2015, s. 251–273.zobacz w PBN
2014
- Paweł Urzyczyn, Games for Intuitionistic Logic, w: Trends in Logic XIII, Wydawnictwo Uniwersytetu Łódzkiego, Łódź 2014, s. 247–269.zobacz w PBN
2013
- Boris Düdder, Oliver Garbe, Moritz Martens, Jakob Rehof i Paweł Urzyczyn, Using Inhabitation in Bounded Combinatory Logic with Intersection Typesfor Composition Synthesis, Electronic Proceedings In Theoretical Computer Science 121 2013, s. 18–34.zobacz w PBN
- Paweł Urzyczyn, Undecidability of inhabitation, w: Lambda Calculus with Types, Association for Symbolic Logic - Cambridge University Press, Cambridge 2013, r. 175, s. 762–786.zobacz w PBN
2012
- Boris Düdder, Moritz Martens, Jakob Rehof i Paweł Urzyczyn, Bounded Combinatory Logic, w: CSL, 2012.zobacz w PBN
- Jakob Rehof i Paweł Urzyczyn, The Complexity of Inhabitation with Explicit Intersection, w: Logic and Program Semantics, Springer, Berlin 2012.zobacz w PBN
2007
- Thorsten Altenkirch i Paweł Urzyczyn (red.), Special Issue on the 7th International Conference on Typed Lambda Calculi and Applications, TLCA '05, IOS Press, Amsterdam 2007.zobacz w PBN
- M. Sorensen i Paweł Urzyczyn, Sequent Calculus, Dialogues, and Cut-Elimination,, w: Reflections on Type Theory, Lambda Calculus, and the Mind, Essays Dedicated to Henk Barendregt on the Occasion of his 60th Birthday, Radboud University, Nijmegen 2007.zobacz w PBN
2006
- M. Sorensen i Paweł Urzyczyn, Lectures on the Curry-Howard Isomorphism, Elsevier, Amsterdam 2006.zobacz w PBN
- Paweł Urzyczyn, Predicates as Types, w: Proof Technology and Computation, IOS Press, Amsterdam 2006.zobacz w PBN
- P. Kralovic i Paweł Urzyczyn (red.), Mathematical Foundations of Computer Science 31st Int. Symposium, Springer, Berlin 2006.zobacz w PBN
2005
- Teodor Knapik, Damian Niwiński, Paweł Urzyczyn i Igor Walukiewicz, Unsafe Grammars and Panic Automata, Lecture Notes In Computer Science 3580 2005, s. 1450–1461.zobacz w PBN
- Paweł Urzyczyn (red.), Typed Lambda Calculi and Applications, 7th International Conference, TLCA 2005, Springer Verlag, Berlin 2005.zobacz w PBN
- Martin Hofmann i Paweł Urzyczyn (red.), Typed Lambda Calculi and Applications 2003, Selected Papers, IOS Press, Amsterdam 2005.zobacz w PBN
Nie jesteś zalogowany | zaloguj się
