The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Pawel Urzyczyn: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn
    ML Typability is DEXTIME-Complete. [Citation Graph (1, 0)][DBLP]
    CAAP, 1990, pp:206-220 [Conf]
  2. A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn
    The Hierarchy of Finitely Typed Functional Programs (Short Version) [Citation Graph (1, 0)][DBLP]
    LICS, 1987, pp:225-235 [Conf]
  3. A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn
    The Undecidability of the Semi-Unification Problem (Preliminary Report) [Citation Graph (1, 0)][DBLP]
    STOC, 1990, pp:468-476 [Conf]
  4. Pawel Urzyczyn
    My (Un)Favourite Things. [Citation Graph (0, 0)][DBLP]
    CSL, 2004, pp:25- [Conf]
  5. A. J. Kfoury, Pawel Urzyczyn
    Algo-Like Languages with Higher-Order Procedures and Their Expressive Power. [Citation Graph (0, 0)][DBLP]
    Logic at Botik, 1989, pp:186-199 [Conf]
  6. Wojciech Kowalczyk, Pawel Urzyczyn
    Verification of Programs with Higher-Order Arrays. [Citation Graph (0, 0)][DBLP]
    FCT, 1987, pp:251-258 [Conf]
  7. Pawel Urzyczyn
    Deterministic Context-Free Dynamic Logic is More Expressive than Deterministic Dynamic Logic of Regular Programs. [Citation Graph (0, 0)][DBLP]
    FCT, 1983, pp:498-504 [Conf]
  8. Jerzy Tiuryn, Pawel Urzyczyn
    Some Relationships between Logics of Programs and Complexity Theory (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1983, pp:180-184 [Conf]
  9. Teodor Knapik, Damian Niwinski, Pawel Urzyczyn
    Higher-Order Pushdown Trees Are Easy. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2002, pp:205-222 [Conf]
  10. Teodor Knapik, Damian Niwinski, Pawel Urzyczyn, Igor Walukiewicz
    Unsafe Grammars and Panic Automata. [Citation Graph (0, 0)][DBLP]
    ICALP, 2005, pp:1450-1461 [Conf]
  11. Zdzislaw Splawski, Pawel Urzyczyn
    Type Fixpoints: Iteration vs. Recursion. [Citation Graph (0, 0)][DBLP]
    ICFP, 1999, pp:102-113 [Conf]
  12. Steffen van Bakel, Luigi Liquori, Simona Ronchi Della Rocca, Pawel Urzyczyn
    Comparing Cubes. [Citation Graph (0, 0)][DBLP]
    LFCS, 1994, pp:353-365 [Conf]
  13. Mariangiola Dezani-Ciancaglini, Jerzy Tiuryn, Pawel Urzyczyn
    Discrimination by Parallel Observers. [Citation Graph (0, 0)][DBLP]
    LICS, 1997, pp:396-407 [Conf]
  14. A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn
    On the Computational Power of Universally Polymorphic Recursion [Citation Graph (0, 0)][DBLP]
    LICS, 1988, pp:72-81 [Conf]
  15. A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn
    Computational Consequences and Partial Solutions of a Generalized Unification Problem (Partial Report) [Citation Graph (0, 0)][DBLP]
    LICS, 1989, pp:98-105 [Conf]
  16. Jerzy Tiuryn, Pawel Urzyczyn
    The Subtyping Problem for Second-Order Types is Undecidable. [Citation Graph (0, 0)][DBLP]
    LICS, 1996, pp:74-85 [Conf]
  17. Pawel Urzyczyn
    The Emptiness Problem for Intersection Types [Citation Graph (0, 0)][DBLP]
    LICS, 1994, pp:300-309 [Conf]
  18. A. J. Kfoury, Pawel Urzyczyn
    Necessary and Sufficient Conditions for University of Programming Formalisms (Partial Report). [Citation Graph (0, 0)][DBLP]
    Logic of Programs, 1983, pp:279-289 [Conf]
  19. Jerzy Tiuryn, Pawel Urzyczyn
    Remarks on Comparing Expressive Power of Logics of Programs. [Citation Graph (0, 0)][DBLP]
    MFCS, 1984, pp:535-543 [Conf]
  20. Pawel Urzyczyn
    Positive Recursive Type Assignment. [Citation Graph (0, 0)][DBLP]
    MFCS, 1995, pp:382-391 [Conf]
  21. A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn
    A Proper Extension of ML with an Effective Type-Assignment. [Citation Graph (0, 0)][DBLP]
    POPL, 1988, pp:58-69 [Conf]
  22. Teodor Knapik, Damian Niwinski, Pawel Urzyczyn
    Deciding Monadic Theories of Hyperalgebraic Trees. [Citation Graph (0, 0)][DBLP]
    TLCA, 2001, pp:253-267 [Conf]
  23. Pawel Urzyczyn
    Type reconstruction in F-omega is undecidable. [Citation Graph (0, 0)][DBLP]
    TLCA, 1993, pp:418-432 [Conf]
  24. Pawel Urzyczyn
    Inhabitation in Typed Lambda-Calculi (A Syntactic Approach). [Citation Graph (0, 0)][DBLP]
    TLCA, 1997, pp:373-389 [Conf]
  25. Viviana Bono, Jerzy Tiuryn, Pawel Urzyczyn
    Type Inference for Nested Self Types. [Citation Graph (0, 0)][DBLP]
    TYPES, 2003, pp:99-114 [Conf]
  26. A. J. Kfoury, Pawel Urzyczyn
    Necessary and Sufficient Conditions for the Universality of Programming Formalisms. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1985, v:22, n:4, pp:347-377 [Journal]
  27. Steffen van Bakel, Luigi Liquori, Simona Ronchi Della Rocca, Pawel Urzyczyn
    Comparing Cubes of Typed and Type Assignment Systems. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1997, v:86, n:3, pp:267-303 [Journal]
  28. Laurent Regnier, Pawel Urzyczyn
    Retractions of Types with Many Atoms [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  29. Martin Hofmann, Pawel Urzyczyn
    Typed Lambda Calculi and Applications 2003, Selected Papers. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2005, v:65, n:1-2, pp:- [Journal]
  30. Pawel Urzyczyn
    Algorithmic triviality of abstract structures. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1981, v:4, n:4, pp:819-850 [Journal]
  31. Pawel Urzyczyn
    Primitive Recursion with Extential Types. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1993, v:19, n:1/2, pp:201-222 [Journal]
  32. Pawel Urzyczyn
    Positive Recursive Type Assignment. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1996, v:28, n:1-2, pp:197-209 [Journal]
  33. Mariangiola Dezani-Ciancaglini, Jerzy Tiuryn, Pawel Urzyczyn
    Discrimination by Parallel Observers: The Algorithm. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1999, v:150, n:2, pp:153-186 [Journal]
  34. A. J. Kfoury, Simona Ronchi Della Rocca, Jerzy Tiuryn, Pawel Urzyczyn
    Alpha-Conversion and Typability. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1999, v:150, n:1, pp:1-21 [Journal]
  35. A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn
    The Undecidability of the Semi-unification Problem [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1993, v:102, n:1, pp:83-101 [Journal]
  36. Pawel Urzyczyn
    The Unwind Property in Certain Algebras [Citation Graph (0, 0)][DBLP]
    Information and Control, 1981, v:50, n:2, pp:91-109 [Journal]
  37. Pawel Urzyczyn
    A Necessary and Sufficient Condition in Order That a Herbrand Interpretation Be Expressive Relative to Recursive Programs [Citation Graph (0, 0)][DBLP]
    Information and Control, 1983, v:56, n:3, pp:212-219 [Journal]
  38. Pawel Urzyczyn
    Nontrivial Definability by Flow-Chart Programs [Citation Graph (0, 0)][DBLP]
    Information and Control, 1983, v:58, n:1-3, pp:59-87 [Journal]
  39. Jerzy Tiuryn, Pawel Urzyczyn
    The Subtyping Problem for Second-Order Types Is Undecidable. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2002, v:179, n:1, pp:1-18 [Journal]
  40. A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn
    An Analysis of ML Typability. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1994, v:41, n:2, pp:368-398 [Journal]
  41. Pawel Urzyczyn
    "During" Cannot be Expressed by "After". [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1986, v:32, n:1, pp:97-104 [Journal]
  42. Pawel Urzyczyn
    The Emptiness Problem for Intersection Types. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1999, v:64, n:3, pp:1195-1215 [Journal]
  43. Pawel Urzyczyn
    A Simple Proof of the Undecidability of Strong Normalisation. [Citation Graph (0, 0)][DBLP]
    Mathematical Structures in Computer Science, 2003, v:13, n:1, pp:5-13 [Journal]
  44. Pawel Urzyczyn
    Type Reconstruction in Fomega. [Citation Graph (0, 0)][DBLP]
    Mathematical Structures in Computer Science, 1997, v:7, n:4, pp:329-358 [Journal]
  45. A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn
    On the Expressive Power of Finitely and Universally Polymorphic Recursive Procedures. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1992, v:93, n:1, pp:1-41 [Journal]
  46. Jerzy Tiuryn, Pawel Urzyczyn
    Some Relationships Between Logics of Programs and Complexity Theory. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1988, v:60, n:, pp:83-108 [Journal]
  47. A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn
    Type Reconstruction in the Presence of Polymorphic Recursion. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 1993, v:15, n:2, pp:290-311 [Journal]

  48. Inhabitation of Low-Rank Intersection Types. [Citation Graph (, )][DBLP]


  49. In the Search of a Naive Type Theory. [Citation Graph (, )][DBLP]


Search in 0.009secs, Finished in 0.313secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002