Pawel Urzyczyn

70 papers A* 10A 1B 9Misc 1Journal 34Unranked 14

Year	Rank	Type	Title / Venue / Authors
2024	J	`jnl`	Between proof construction and SAT-solving. CoRR Aleksy Schubert, Pawel Urzyczyn, Konrad Zdanowski
2024	J	`jnl`	The existential fragment of second-order propositional intuitionistic logic is undecidable. J. Appl. Non Class. Logics Ken-etsu Fujita, Aleksy Schubert, Pawel Urzyczyn, Konrad Zdanowski
2021	J	`jnl`	Kripke Semantics for Intersection Formulas. ACM Trans. Comput. Log. Andrej Dudenhefner, Pawel Urzyczyn
2020	—	`conf`	Duality in Intuitionistic Propositional Logic. TYPES Pawel Urzyczyn
2018	J	`jnl`	First-order Answer Set Programming as Constructive Proof Search. Theory Pract. Log. Program. Aleksy Schubert, Pawel Urzyczyn
2018	J	`jnl`	First-order answer set programming as constructive proof search. CoRR Aleksy Schubert, Pawel Urzyczyn
2016	J	`jnl`	How Hard Is Positive Quantification? ACM Trans. Comput. Log. Aleksy Schubert, Pawel Urzyczyn, Daria Walukiewicz-Chrzaszcz
2016	J	`jnl`	Intuitionistic Games: Determinacy, Completeness, and Normalization. Stud Logica Pawel Urzyczyn
2016	J	`jnl`	On the Mints Hierarchy in First-Order Intuitionistic Logic. Log. Methods Comput. Sci. Aleksy Schubert, Pawel Urzyczyn, Konrad Zdanowski
2015	B	`conf`	On the Mints Hierarchy in First-Order Intuitionistic Logic. FoSSaCS Aleksy Schubert, Pawel Urzyczyn, Konrad Zdanowski
2014	—	`conf`	Restricted Positive Quantification Is Not Elementary. TYPES Aleksy Schubert, Pawel Urzyczyn, Daria Walukiewicz-Chrzaszcz
2012	B	`conf`	Bounded Combinatory Logic. CSL Boris Düdder, Moritz Martens, Jakob Rehof, Pawel Urzyczyn
2012	—	`conf`	The Complexity of Inhabitation with Explicit Intersection. Logic and Program Semantics Jakob Rehof, Pawel Urzyczyn
2012	—	`conf`	Using Inhabitation in Bounded Combinatory Logic with Intersection Types for Composition Synthesis. ITRS Boris Düdder, Oliver Garbe, Moritz Martens, Jakob Rehof, Pawel Urzyczyn
2011	—	`conf`	Finite Combinatory Logic with Intersection Types. TLCA Jakob Rehof, Pawel Urzyczyn
2010	J	`jnl`	A Syntactic Embedding of Predicate Logic into Second-Order Propositional Logic. Notre Dame J. Formal Log. Morten Heine Sørensen, Pawel Urzyczyn
2010	J	`jnl`	Preface. Fundam. Informaticae Anna Gambin, Damian Niwinski, Pawel Urzyczyn
2010	J	`jnl`	The Logic of Persistent Intersection. Fundam. Informaticae Pawel Urzyczyn
2009	—	`conf`	Inhabitation of Low-Rank Intersection Types. TLCA Pawel Urzyczyn
2008	J	`jnl`	Strong cut-elimination in sequent calculus using Klop's iota-translation and perpetual reductions. J. Symb. Log. Morten Heine Sørensen, Pawel Urzyczyn
2007	—	`conf`	In the Search of a Naive Type Theory. TYPES Agnieszka Kozubek, Pawel Urzyczyn
2006	B	`ed.`	Mathematical Foundations of Computer Science 2006, 31st International Symposium, MFCS 2006, Stará Lesná, Slovakia, August 28-September 1, 2006, Proceedings MFCS Rastislav Kralovic, Pawel Urzyczyn
2005	J	`jnl`	Typed Lambda Calculi and Applications 2003, Selected Papers. Fundam. Informaticae Martin Hofmann, Pawel Urzyczyn
2005	—	`ed.`	Typed Lambda Calculi and Applications, 7th International Conference, TLCA 2005, Nara, Japan, April 21-23, 2005, Proceedings TLCA Pawel Urzyczyn
2005	A*	`conf`	Unsafe Grammars and Panic Automata. ICALP Teodor Knapik, Damian Niwinski, Pawel Urzyczyn, Igor Walukiewicz
2004	B	`conf`	My (Un)Favourite Things. CSL Pawel Urzyczyn
2003	J	`jnl`	A Simple Proof of the Undecidability of Strong Normalisation. Math. Struct. Comput. Sci. Pawel Urzyczyn
2003	—	`conf`	Type Inference for Nested Self Types. TYPES Viviana Bono, Jerzy Tiuryn, Pawel Urzyczyn
2002	B	`conf`	Higher-Order Pushdown Trees Are Easy. FoSSaCS Teodor Knapik, Damian Niwinski, Pawel Urzyczyn
2002	J	`jnl`	Retractions of Types with Many Atoms CoRR Laurent Regnier, Pawel Urzyczyn
2002	J	`jnl`	The Subtyping Problem for Second-Order Types Is Undecidable. Inf. Comput. Jerzy Tiuryn, Pawel Urzyczyn
2001	—	`conf`	Deciding Monadic Theories of Hyperalgebraic Trees. TLCA Teodor Knapik, Damian Niwinski, Pawel Urzyczyn
1999	J	`jnl`	Alpha-Conversion and Typability. Inf. Comput. A. J. Kfoury, Simona Ronchi Della Rocca, Jerzy Tiuryn, Pawel Urzyczyn
1999	J	`jnl`	Discrimination by Parallel Observers: The Algorithm. Inf. Comput. Mariangiola Dezani-Ciancaglini, Jerzy Tiuryn, Pawel Urzyczyn
1999	J	`jnl`	The Emptiness Problem for Intersection Types. J. Symb. Log. Pawel Urzyczyn
1999	A	`conf`	Type Fixpoints: Iteration vs. Recursion. ICFP Zdzislaw Splawski, Pawel Urzyczyn
1997	J	`jnl`	Comparing Cubes of Typed and Type Assignment Systems. Ann. Pure Appl. Log. Steffen van Bakel, Luigi Liquori, Simona Ronchi Della Rocca, Pawel Urzyczyn
1997	A*	`conf`	Discrimination by Parallel Observers. LICS Mariangiola Dezani-Ciancaglini, Jerzy Tiuryn, Pawel Urzyczyn
1997	—	`conf`	Inhabitation in Typed Lambda-Calculi (A Syntactic Approach). TLCA Pawel Urzyczyn
1997	J	`jnl`	Type Reconstruction in F Math. Struct. Comput. Sci. Pawel Urzyczyn
1996	J	`jnl`	Positive Recursive Type Assignment. Fundam. Informaticae Pawel Urzyczyn
1996	A*	`conf`	The Subtyping Problem for Second-Order Types is Undecidable. LICS Jerzy Tiuryn, Pawel Urzyczyn
1995	B	`conf`	Positive Recursive Type Assignment. MFCS Pawel Urzyczyn
1994	J	`jnl`	An Analysis of ML Typability. J. ACM A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn
1994	Misc	`conf`	Comparing Cubes. LFCS Steffen van Bakel, Luigi Liquori, Simona Ronchi Della Rocca, Pawel Urzyczyn
1994	A*	`conf`	The Emptiness Problem for Intersection Types LICS Pawel Urzyczyn
1993	J	`jnl`	Primitive Recursion with Extential Types. Fundam. Informaticae Pawel Urzyczyn
1993	J	`jnl`	The Undecidability of the Semi-unification Problem Inf. Comput. A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn
1993	J	`jnl`	Type Reconstruction in the Presence of Polymorphic Recursion. ACM Trans. Program. Lang. Syst. A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn
1993	—	`conf`	Type reconstruction in F-omega is undecidable. TLCA Pawel Urzyczyn
1992	J	`jnl`	On the Expressive Power of Finitely and Universally Polymorphic Recursive Procedures. Theor. Comput. Sci. A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn
1990	—	`conf`	ML Typability is DEXTIME-Complete. CAAP A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn
1990	A*	`conf`	The Undecidability of the Semi-Unification Problem (Preliminary Report) STOC A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn
1989	—	`conf`	Algo-Like Languages with Higher-Order Procedures and Their Expressive Power. Logic at Botik A. J. Kfoury, Pawel Urzyczyn
1989	A*	`conf`	Computational Consequences and Partial Solutions of a Generalized Unification Problem (Partial Report) LICS A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn
1988	A*	`conf`	A Proper Extension of ML with an Effective Type-Assignment. POPL A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn
1988	A*	`conf`	On the Computational Power of Universally Polymorphic Recursion LICS A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn
1988	J	`jnl`	Some Relationships Between Logics of Programs and Complexity Theory. Theor. Comput. Sci. Jerzy Tiuryn, Pawel Urzyczyn
1987	A*	`conf`	The Hierarchy of Finitely Typed Functional Programs (Short Version) LICS A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn
1987	B	`conf`	Verification of Programs with Higher-Order Arrays. FCT Wojciech Kowalczyk, Pawel Urzyczyn
1986	J	`jnl`	"During" Cannot be Expressed by "After". J. Comput. Syst. Sci. Pawel Urzyczyn
1985	J	`jnl`	Necessary and Sufficient Conditions for the Universality of Programming Formalisms. Acta Informatica A. J. Kfoury, Pawel Urzyczyn
1984	B	`conf`	Remarks on Comparing Expressive Power of Logics of Programs. MFCS Jerzy Tiuryn, Pawel Urzyczyn
1983	J	`jnl`	A Necessary and Sufficient Condition in Order That a Herbrand Interpretation Be Expressive Relative to Recursive Programs Inf. Control. Pawel Urzyczyn
1983	B	`conf`	Deterministic Context-Free Dynamic Logic is More Expressive than Deterministic Dynamic Logic of Regular Programs. FCT Pawel Urzyczyn
1983	—	`conf`	Necessary and Sufficient Conditions for University of Programming Formalisms (Partial Report). Logic of Programs A. J. Kfoury, Pawel Urzyczyn
1983	J	`jnl`	Nontrivial Definability by Flow-Chart Programs Inf. Control. Pawel Urzyczyn
1983	A*	`conf`	Some Relationships between Logics of Programs and Complexity Theory (Extended Abstract) FOCS Jerzy Tiuryn, Pawel Urzyczyn
1981	J	`jnl`	Algorithmic triviality of abstract structures. Fundam. Informaticae Pawel Urzyczyn
1981	J	`jnl`	The Unwind Property in Certain Algebras Inf. Control. Pawel Urzyczyn