Pawel Urzyczyn
Orcid: 0000-0003-3719-9618Affiliations:
- University of Warsaw, Poland
According to our database1,
Pawel Urzyczyn
authored at least 63 papers
between 1981 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
1985
1990
1995
2000
2005
2010
2015
2020
0
1
2
3
4
5
6
2
1
1
3
3
1
1
1
2
3
2
1
1
3
1
1
1
1
2
2
1
1
3
1
1
1
1
1
1
1
1
1
2
1
1
2
2
2
2
1
3
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
-
on id.loc.gov
On csauthors.net:
Bibliography
2024
The existential fragment of second-order propositional intuitionistic logic is undecidable.
J. Appl. Non Class. Logics, January, 2024
2021
2020
Proceedings of the 26th International Conference on Types for Proofs and Programs, 2020
2018
Theory Pract. Log. Program., 2018
2016
Stud Logica, 2016
Log. Methods Comput. Sci., 2016
2014
Proceedings of the 20th International Conference on Types for Proofs and Programs, 2014
2012
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
Proceedings of the Logic and Program Semantics, 2012
2011
Proceedings of the Typed Lambda Calculi and Applications - 10th International Conference, 2011
2010
Notre Dame J. Formal Log., 2010
2009
Proceedings of the Typed Lambda Calculi and Applications, 9th International Conference, 2009
2008
Strong cut-elimination in sequent calculus using Klop's iota-translation and perpetual reductions.
J. Symb. Log., 2008
2007
Proceedings of the Types for Proofs and Programs, International Conference, 2007
2005
Fundam. Informaticae, 2005
Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005
2004
Proceedings of the Computer Science Logic, 18th International Workshop, 2004
2003
Math. Struct. Comput. Sci., 2003
Proceedings of the Types for Proofs and Programs, International Workshop, 2003
2002
Proceedings of the Foundations of Software Science and Computation Structures, 2002
2001
Proceedings of the Typed Lambda Calculi and Applications, 5th International Conference, 2001
1999
Proceedings of the fourth ACM SIGPLAN International Conference on Functional Programming (ICFP '99), 1999
1997
Proceedings of the Typed Lambda Calculi and Applications, 1997
Proceedings of the Proceedings, 12th Annual IEEE Symposium on Logic in Computer Science, Warsaw, Poland, June 29, 1997
1996
1994
Proceedings of the Logical Foundations of Computer Science, Third International Symposium, 1994
1993
ACM Trans. Program. Lang. Syst., 1993
Primitive Recursion with Extential Types.
Fundam. Informaticae, 1993
Proceedings of the Typed Lambda Calculi and Applications, 1993
1992
On the Expressive Power of Finitely and Universally Polymorphic Recursive Procedures.
Theor. Comput. Sci., 1992
1990
Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990
1989
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
Proceedings of the Logic at Botik '89, 1989
1988
Theor. Comput. Sci., 1988
Proceedings of the Conference Record of the Fifteenth Annual ACM Symposium on Principles of Programming Languages, 1988
Proceedings of the Third Annual Symposium on Logic in Computer Science (LICS '88), 1988
1987
The Hierarchy of Finitely Typed Functional Programs (Short Version)
Proceedings of the Symposium on Logic in Computer Science (LICS '87), 1987
Proceedings of the Fundamentals of Computation Theory, 1987
1986
1985
Acta Informatica, 1985
1984
Proceedings of the Mathematical Foundations of Computer Science 1984, 1984
1983
A Necessary and Sufficient Condition in Order That a Herbrand Interpretation Be Expressive Relative to Recursive Programs
Inf. Control., March, 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
1981
Algorithmic triviality of abstract structures.
Fundam. Informaticae, 1981