Pawel Urzyczyn

Jakob Rehof, Pawel Urzyczyn: The Complexity of Inhabitation with Explicit Intersection. Logic and Program Semantics 2012: 256-270

Boris Düdder, Moritz Martens, Jakob Rehof, Pawel Urzyczyn: Bounded Combinatory Logic. CSL 2012: 243-258

Jakob Rehof, Pawel Urzyczyn: Finite Combinatory Logic with Intersection Types. TLCA 2011: 169-183

Anna Gambin, Damian Niwinski, Pawel Urzyczyn: Preface. Fundam. Inform. 103(1-4) (2010)

Pawel Urzyczyn: The Logic of Persistent Intersection. Fundam. Inform. 103(1-4): 303-322 (2010)

Morten Heine Sørensen, Pawel Urzyczyn: A Syntactic Embedding of Predicate Logic into Second-Order Propositional Logic. Notre Dame Journal of Formal Logic 51(4): 457-473 (2010)

Pawel Urzyczyn: Inhabitation of Low-Rank Intersection Types. TLCA 2009: 356-370

Morten Heine Sørensen, Pawel Urzyczyn: Strong cut-elimination in sequent calculus using Klop's iota-translation and perpetual reductions. J. Symb. Log. 73(3): 919-932 (2008)

Agnieszka Kozubek, Pawel Urzyczyn: In the Search of a Naive Type Theory. TYPES 2007: 110-124

Rastislav Kralovic, Pawel Urzyczyn (Eds.): Mathematical Foundations of Computer Science 2006, 31st International Symposium, MFCS 2006, Stará Lesná, Slovakia, August 28-September 1, 2006, Proceedings. Lecture Notes in Computer Science 4162, Springer 2006, isbn 3-540-37791-3

Martin Hofmann, Pawel Urzyczyn: Typed Lambda Calculi and Applications 2003, Selected Papers. Fundam. Inform. 65(1-2) (2005)

Teodor Knapik, Damian Niwinski, Pawel Urzyczyn, Igor Walukiewicz: Unsafe Grammars and Panic Automata. ICALP 2005: 1450-1461

Pawel Urzyczyn (Ed.): Typed Lambda Calculi and Applications, 7th International Conference, TLCA 2005, Nara, Japan, April 21-23, 2005, Proceedings. Lecture Notes in Computer Science 3461, Springer 2005, isbn 3-540-25593-1

Pawel Urzyczyn: My (Un)Favourite Things. CSL 2004: 25

Pawel Urzyczyn: A Simple Proof of the Undecidability of Strong Normalisation. Mathematical Structures in Computer Science 13(1): 5-13 (2003)

Viviana Bono, Jerzy Tiuryn, Pawel Urzyczyn: Type Inference for Nested Self Types. TYPES 2003: 99-114

Jerzy Tiuryn, Pawel Urzyczyn: The Subtyping Problem for Second-Order Types Is Undecidable. Inf. Comput. 179(1): 1-18 (2002)

Teodor Knapik, Damian Niwinski, Pawel Urzyczyn: Higher-Order Pushdown Trees Are Easy. FoSSaCS 2002: 205-222

Laurent Regnier, Pawel Urzyczyn: Retractions of Types with Many Atoms. CoRR cs.LO/0212005 (2002)

Teodor Knapik, Damian Niwinski, Pawel Urzyczyn: Deciding Monadic Theories of Hyperalgebraic Trees. TLCA 2001: 253-267

A. J. Kfoury, Simona Ronchi Della Rocca, Jerzy Tiuryn, Pawel Urzyczyn: Alpha-Conversion and Typability. Inf. Comput. 150(1): 1-21 (1999)

Mariangiola Dezani-Ciancaglini, Jerzy Tiuryn, Pawel Urzyczyn: Discrimination by Parallel Observers: The Algorithm. Inf. Comput. 150(2): 153-186 (1999)

Pawel Urzyczyn: The Emptiness Problem for Intersection Types. J. Symb. Log. 64(3): 1195-1215 (1999)

Zdzislaw Splawski, Pawel Urzyczyn: Type Fixpoints: Iteration vs. Recursion. ICFP 1999: 102-113

Steffen van Bakel, Luigi Liquori, Simona Ronchi Della Rocca, Pawel Urzyczyn: Comparing Cubes of Typed and Type Assignment Systems. Ann. Pure Appl. Logic 86(3): 267-303 (1997)

Pawel Urzyczyn: Type Reconstruction in F_omega. Mathematical Structures in Computer Science 7(4): 329-358 (1997)

Mariangiola Dezani-Ciancaglini, Jerzy Tiuryn, Pawel Urzyczyn: Discrimination by Parallel Observers. LICS 1997: 396-407

Pawel Urzyczyn: Inhabitation in Typed Lambda-Calculi (A Syntactic Approach). TLCA 1997: 373-389

Pawel Urzyczyn: Positive Recursive Type Assignment. Fundam. Inform. 28(1-2): 197-209 (1996)

Jerzy Tiuryn, Pawel Urzyczyn: The Subtyping Problem for Second-Order Types is Undecidable. LICS 1996: 74-85

Pawel Urzyczyn: Positive Recursive Type Assignment. MFCS 1995: 382-391

A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn: An Analysis of ML Typability. J. ACM 41(2): 368-398 (1994)

Steffen van Bakel, Luigi Liquori, Simona Ronchi Della Rocca, Pawel Urzyczyn: Comparing Cubes. LFCS 1994: 353-365

Pawel Urzyczyn: The Emptiness Problem for Intersection Types. LICS 1994: 300-309

Pawel Urzyczyn: Primitive Recursion with Extential Types. Fundam. Inform. 19(1/2): 201-222 (1993)

A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn: The Undecidability of the Semi-unification Problem. Inf. Comput. 102(1): 83-101 (1993)

A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn: Type Reconstruction in the Presence of Polymorphic Recursion. ACM Trans. Program. Lang. Syst. 15(2): 290-311 (1993)

Pawel Urzyczyn: Type reconstruction in F-omega is undecidable. TLCA 1993: 418-432

A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn: On the Expressive Power of Finitely and Universally Polymorphic Recursive Procedures. Theor. Comput. Sci. 93(1): 1-41 (1992)

A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn: ML Typability is DEXTIME-Complete. CAAP 1990: 206-220

A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn: The Undecidability of the Semi-Unification Problem (Preliminary Report). STOC 1990: 468-476

A. J. Kfoury, Pawel Urzyczyn: Algo-Like Languages with Higher-Order Procedures and Their Expressive Power. Logic at Botik 1989: 186-199

A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn: Computational Consequences and Partial Solutions of a Generalized Unification Problem (Partial Report). LICS 1989: 98-105

Jerzy Tiuryn, Pawel Urzyczyn: Some Relationships Between Logics of Programs and Complexity Theory. Theor. Comput. Sci. 60: 83-108 (1988)

A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn: On the Computational Power of Universally Polymorphic Recursion. LICS 1988: 72-81

A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn: A Proper Extension of ML with an Effective Type-Assignment. POPL 1988: 58-69

Wojciech Kowalczyk, Pawel Urzyczyn: Verification of Programs with Higher-Order Arrays. FCT 1987: 251-258

A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn: The Hierarchy of Finitely Typed Functional Programs (Short Version). LICS 1987: 225-235

Pawel Urzyczyn: "During" Cannot be Expressed by "After". J. Comput. Syst. Sci. 32(1): 97-104 (1986)

A. J. Kfoury, Pawel Urzyczyn: Necessary and Sufficient Conditions for the Universality of Programming Formalisms. Acta Inf. 22(4): 347-377 (1985)

Jerzy Tiuryn, Pawel Urzyczyn: Remarks on Comparing Expressive Power of Logics of Programs. MFCS 1984: 535-543

Pawel Urzyczyn: A Necessary and Sufficient Condition in Order That a Herbrand Interpretation Be Expressive Relative to Recursive Programs. Information and Control 56(3): 212-219 (1983)

Pawel Urzyczyn: Nontrivial Definability by Flow-Chart Programs. Information and Control 58(1-3): 59-87 (1983)

Pawel Urzyczyn: Deterministic Context-Free Dynamic Logic is More Expressive than Deterministic Dynamic Logic of Regular Programs. FCT 1983: 498-504

Jerzy Tiuryn, Pawel Urzyczyn: Some Relationships between Logics of Programs and Complexity Theory (Extended Abstract). FOCS 1983: 180-184

A. J. Kfoury, Pawel Urzyczyn: Necessary and Sufficient Conditions for University of Programming Formalisms (Partial Report). Logic of Programs 1983: 279-289

Pawel Urzyczyn: Algorithmic triviality of abstract structures. Fundam. Inform. 4(4): 819-850 (1981)

Pawel Urzyczyn: The Unwind Property in Certain Algebras. Information and Control 50(2): 91-109 (1981)