According to our database1, Pawel Urzyczyn authored at least 59 papers between 1981 and 2018.
Legend:Book In proceedings Article PhD thesis Other
First-order Answer Set Programming as Constructive Proof Search.
How Hard Is Positive Quantification?
ACM Trans. Comput. Log., 2016
Intuitionistic Games: Determinacy, Completeness, and Normalization.
Studia Logica, 2016
On the Mints Hierarchy in First-Order Intuitionistic Logic.
Proceedings of the Foundations of Software Science and Computation Structures, 2015
Restricted Positive Quantification Is Not Elementary.
Proceedings of the 20th International Conference on Types for Proofs and Programs, 2014
Using Inhabitation in Bounded Combinatory Logic with Intersection Types for Composition Synthesis.
Proceedings of the Proceedings Sixth Workshop on Intersection Types and Related Systems, 2012
Bounded Combinatory Logic.
Proceedings of the Computer Science Logic (CSL'12), 2012
The Complexity of Inhabitation with Explicit Intersection.
Proceedings of the Logic and Program Semantics, 2012
Finite Combinatory Logic with Intersection Types.
Proceedings of the Typed Lambda Calculi and Applications - 10th International Conference, 2011
A Syntactic Embedding of Predicate Logic into Second-Order Propositional Logic.
Notre Dame Journal of Formal Logic, 2010
The Logic of Persistent Intersection.
Fundam. Inform., 2010
Fundam. Inform., 2010
Inhabitation of Low-Rank Intersection Types.
Proceedings of the Typed Lambda Calculi and Applications, 9th International Conference, 2009
Strong cut-elimination in sequent calculus using Klop's iota-translation and perpetual reductions.
J. Symb. Log., 2008
In the Search of a Naive Type Theory.
Proceedings of the Types for Proofs and Programs, International Conference, 2007
Typed Lambda Calculi and Applications 2003, Selected Papers.
Fundam. Inform., 2005
Unsafe Grammars and Panic Automata.
Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005
My (Un)Favourite Things.
Proceedings of the Computer Science Logic, 18th International Workshop, 2004
A Simple Proof of the Undecidability of Strong Normalisation.
Mathematical Structures in Computer Science, 2003
Type Inference for Nested Self Types.
Proceedings of the Types for Proofs and Programs, International Workshop, 2003
Higher-Order Pushdown Trees Are Easy.
Proceedings of the Foundations of Software Science and Computation Structures, 2002
Deciding Monadic Theories of Hyperalgebraic Trees.
The Emptiness Problem for Intersection Types.
J. Symb. Log., 1999
Alpha-Conversion and Typability.
Inf. Comput., 1999
Discrimination by Parallel Observers: The Algorithm.
Inf. Comput., 1999
Type Fixpoints: Iteration vs. Recursion.
Proceedings of the fourth ACM SIGPLAN International Conference on Functional Programming (ICFP '99), 1999
Type Reconstruction in Fomega.
Mathematical Structures in Computer Science, 1997
Comparing Cubes of Typed and Type Assignment Systems.
Ann. Pure Appl. Logic, 1997
Inhabitation in Typed Lambda-Calculi (A Syntactic Approach).
Proceedings of the Typed Lambda Calculi and Applications, 1997
Discrimination by Parallel Observers.
Proceedings of the Proceedings, 12th Annual IEEE Symposium on Logic in Computer Science, Warsaw, Poland, June 29, 1997
The Subtyping Problem for Second-Order Types is Undecidable.
Proceedings of the Proceedings, 1996
Positive Recursive Type Assignment.
Proceedings of the Mathematical Foundations of Computer Science 1995, 1995
An Analysis of ML Typability.
J. ACM, 1994
The Emptiness Problem for Intersection Types
Proceedings of the Ninth Annual Symposium on Logic in Computer Science (LICS '94), 1994
Proceedings of the Logical Foundations of Computer Science, Third International Symposium, 1994
The Undecidability of the Semi-unification Problem
Inf. Comput., January, 1993
Type Reconstruction in the Presence of Polymorphic Recursion.
ACM Trans. Program. Lang. Syst., 1993
Primitive Recursion with Extential Types.
Fundam. Inform., 1993
Type reconstruction in F-omega is undecidable.
Proceedings of the Typed Lambda Calculi and Applications, 1993
On the Expressive Power of Finitely and Universally Polymorphic Recursive Procedures.
Theor. Comput. Sci., 1992
The Undecidability of the Semi-Unification Problem (Preliminary Report)
Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990
ML Typability is DEXTIME-Complete.
Proceedings of the CAAP '90, 1990
Computational Consequences and Partial Solutions of a Generalized Unification Problem (Partial Report)
Proceedings of the Fourth Annual Symposium on Logic in Computer Science (LICS '89), 1989
Algo-Like Languages with Higher-Order Procedures and Their Expressive Power.
Proceedings of the Logic at Botik '89, 1989
Some Relationships Between Logics of Programs and Complexity Theory.
Theor. Comput. Sci., 1988
A Proper Extension of ML with an Effective Type-Assignment.
Proceedings of the Conference Record of the Fifteenth Annual ACM Symposium on Principles of Programming Languages, 1988
On the Computational Power of Universally Polymorphic Recursion
Proceedings of the Third Annual Symposium on Logic in Computer Science (LICS '88), 1988
The Hierarchy of Finitely Typed Functional Programs (Short Version)
Proceedings of the Symposium on Logic in Computer Science (LICS '87), 1987
Verification of Programs with Higher-Order Arrays.
Proceedings of the Fundamentals of Computation Theory, 1987
"During" Cannot be Expressed by "After".
J. Comput. Syst. Sci., 1986
Necessary and Sufficient Conditions for the Universality of Programming Formalisms.
Acta Inf., 1985
Remarks on Comparing Expressive Power of Logics of Programs.
Proceedings of the Mathematical Foundations of Computer Science 1984, 1984
A Necessary and Sufficient Condition in Order That a Herbrand Interpretation Be Expressive Relative to Recursive Programs
Information and Control, March, 1983
Nontrivial Definability by Flow-Chart Programs
Information and Control, 1983
Necessary and Sufficient Conditions for University of Programming Formalisms (Partial Report).
Proceedings of the Logics of Programs, 1983
Some Relationships between Logics of Programs and Complexity Theory (Extended Abstract)
Proceedings of the 24th Annual Symposium on Foundations of Computer Science, 1983
Deterministic Context-Free Dynamic Logic is More Expressive than Deterministic Dynamic Logic of Regular Programs.
Proceedings of the Fundamentals of Computation Theory, 1983
The Unwind Property in Certain Algebras
Information and Control, August, 1981
Algorithmic triviality of abstract structures.
Fundam. Inform., 1981