| ||
| 1. | Finite Combinatory Logic with Intersection Types
LECTURE NOTES IN COMPUTER SCIENCE Tom 6690 r. 2011, str. 169-183 (Artyku³ konferencyjny) Jakob Rehof, Pawe³ Urzyczyn | |
| 2. | A Syntactic Embedding of Predicate Logic into Second-Order Propositional Logic
NOTRE DAME JOURNAL OF FORMAL LOGIC Tom 51 Nr 4 r. 2010, str. 457-473 (Artyku³) Morten Heine Sorensen, Pawe³ Urzyczyn | |
| 3. | Preface
FUNDAMENTA INFORMATICAE Tom 103 Nr 1-4 r. 2010, str. (Artyku³) Anna Gambin, Damian Niwiñski, Pawe³ Urzyczyn | |
| 4. | Inhabitation of Low-Rank Intersection Types
LECTURE NOTES IN COMPUTER SCIENCE Tom 5608 r. 2009, str. 356-370 (Artyku³) Pawe³ Urzyczyn | |
| 5. | In the search of a naive type theory
LECTURE NOTES IN COMPUTER SCIENCE Tom 4941 r. 2008, str. 110-124 (Artyku³) Agnieszka Kozubek, Pawe³ Urzyczyn | |
| 6. | Strong cut-elimination in sequent calculus using Klop's
iota-translation and perpetual reductions
JOURNAL OF SYMBOLIC LOGIC Tom 73 Nr 3 r. 2008, str. 919-932 (Artyku³) Pawe³ Urzyczyn, Morten Heine Soerensen | |
| 7. | Unsafe Grammars and Panic Automata
LECTURE NOTES IN COMPUTER SCIENCE Tom 3580 r. 2005, str. 1450-1461 (Artyku³ konferencyjny) Teodor Knapik, Damian Niwiñski, Pawe³ Urzyczyn, Igor Walukiewicz | |
| 8. | Type inference for nested self types
LECTURE NOTES IN COMPUTER SCIENCE Tom 3085 r. 2004, str. 99-114 (Artyku³ konferencyjny) Viviana Bono, Jerzy Tiuryn, Pawe³ Urzyczyn | |
| 9. | A simple proof of undecidability of strong normalization
Mathematical Structures in Computer Science Tom 13 r. 2003, str. 5-13 (Artyku³) Pawe³ Urzyczyn | |
| 10. | Higher-order pushdown trees are easy
LECTURE NOTES IN COMPUTER SCIENCE Tom 2303 r. 2002, str. 205-222 (Artyku³ konferencyjny) Teodor Knapik, Damian Niwiñski, Pawe³ Urzyczyn | |
| 11. | The subtyping problem for second-order types is undecidable
INFORMATION AND COMPUTATION Tom 179 r. 2002, str. 1-18 (Artyku³) Jerzy Tiuryn, Pawe³ Urzyczyn | |
| 12. | Deciding monadic theories of hyperalgebraic trees
LECTURE NOTES IN COMPUTER SCIENCE Nr 2044 r. 2001, str. 253-267 (Artyku³) Damian Niwiñski, Pawe³ Urzyczyn, T. Knapik | |
| ||
| 13. | Special Issue on the 7th International Conference on Typed Lambda Calculi and Applications, TLCA '05
IOS Press, r. 2007 (Ksi±¿ka) Thorsten Altenkirch (Redaktor), Pawe³ Urzyczyn (Redaktor) | |
| 14. | Lectures on the Curry-Howard Isomorphism
Elsevier, r. 2006 (Ksi±¿ka) M. Sorensen, Pawe³ Urzyczyn | |
| 15. | Mathematical Foundations of Computer Science 31st Int. Symposium
Springer, r. 2006 (Ksi±¿ka) P. Kralovic (Redaktor), Pawe³ Urzyczyn (Redaktor) | |
| 16. | Typed Lambda Calculi and Applications 2003, Selected Papers
IOS Press, r. 2005 (Ksi±¿ka) Martin Hofmann (Redaktor), Pawe³ Urzyczyn (Redaktor) | |
| 17. | Typed Lambda Calculi and Applications, 7th International Conference, TLCA 2005
Springer Verlag, r. 2005 (Ksi±¿ka) Pawe³ Urzyczyn (Redaktor) | |
| 18. | Special Issue Editors of Fundamenta Informaticae
IOS Press, r. 2001 (Ksi±¿ka) J. Girard, Pawe³ Urzyczyn (Redaktor) | |
| ||
| 19. | Bounded Combinatory Logic
w: CSL, str. 243-258, r. 2012 (Artyku³ konferencyjny) Boris Düdder, Moritz Martens, Jakob Rehof, Pawe³ Urzyczyn | |
| 20. | The Complexity of Inhabitation with Explicit Intersection
w: Logic and Program Semantics, str. 256-270, r. 2012 (Artyku³ konferencyjny) Jakob Rehof, Pawe³ Urzyczyn | |
| 21. | 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, str. 253-261, Radboud University, r. 2007 (Esej lub rozdzia³ w ksi±¿ce) M. Sorensen, Pawe³ Urzyczyn | |
| 22. | Predicates as Types
w: Proof Technology and Computation, str. 355-386, IOS Press, r. 2006 (Artyku³) Pawe³ Urzyczyn | |