- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| 57 |      | Jakob Rehof, Pawel Urzyczyn: The Complexity of Inhabitation with Explicit Intersection. Logic and Program Semantics 2012: 256-270 |
| 2011 | ||
| 56 | | Jakob Rehof, Pawel Urzyczyn: Finite Combinatory Logic with Intersection Types. TLCA 2011: 169-183 |
| 2010 | ||
| 55 | | Anna Gambin, Damian Niwinski, Pawel Urzyczyn: Preface. Fundam. Inform. 103(1-4): (2010) |
| 54 | | Pawel Urzyczyn: The Logic of Persistent Intersection. Fundam. Inform. 103(1-4): 303-322 (2010) |
| 53 | | 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) |
| 2009 | ||
| 52 | | Pawel Urzyczyn: Inhabitation of Low-Rank Intersection Types. TLCA 2009: 356-370 |
| 2008 | ||
| 51 | | 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) |
| 2007 | ||
| 50 | | Agnieszka Kozubek, Pawel Urzyczyn: In the Search of a Naive Type Theory. TYPES 2007: 110-124 |
| 2006 | ||
| 49 |  | Rastislav Kralovic, Pawel Urzyczyn: Mathematical Foundations of Computer Science 2006, 31st International Symposium, MFCS 2006, Stará Lesná, Slovakia, August 28-September 1, 2006, Proceedings Springer 2006 |
| 2005 | ||
| 48 | | Pawel Urzyczyn: Typed Lambda Calculi and Applications, 7th International Conference, TLCA 2005, Nara, Japan, April 21-23, 2005, Proceedings Springer 2005 |
| 47 | | Teodor Knapik, Damian Niwinski, Pawel Urzyczyn, Igor Walukiewicz: Unsafe Grammars and Panic Automata. ICALP 2005: 1450-1461 |
| 46 | | Martin Hofmann, Pawel Urzyczyn: Typed Lambda Calculi and Applications 2003, Selected Papers. Fundam. Inform. 65(1-2): (2005) |
| 2004 | ||
| 45 | | Pawel Urzyczyn: My (Un)Favourite Things. CSL 2004: 25 |
| 2003 | ||
| 44 | | Viviana Bono, Jerzy Tiuryn, Pawel Urzyczyn: Type Inference for Nested Self Types. TYPES 2003: 99-114 |
| 43 | | Pawel Urzyczyn: A Simple Proof of the Undecidability of Strong Normalisation. Mathematical Structures in Computer Science 13(1): 5-13 (2003) |
| 2002 | ||
| 42 | | Teodor Knapik, Damian Niwinski, Pawel Urzyczyn: Higher-Order Pushdown Trees Are Easy. FoSSaCS 2002: 205-222 |
| 41 | | Laurent Regnier, Pawel Urzyczyn: Retractions of Types with Many Atoms CoRR cs.LO/0212005: (2002) |
| 40 | | Jerzy Tiuryn, Pawel Urzyczyn: The Subtyping Problem for Second-Order Types Is Undecidable. Inf. Comput. 179(1): 1-18 (2002) |
| 2001 | ||
| 39 | | Teodor Knapik, Damian Niwinski, Pawel Urzyczyn: Deciding Monadic Theories of Hyperalgebraic Trees. TLCA 2001: 253-267 |
| 1999 | ||
| 38 | | Zdzislaw Splawski, Pawel Urzyczyn: Type Fixpoints: Iteration vs. Recursion. ICFP 1999: 102-113 |
| 37 | | A. J. Kfoury, Simona Ronchi Della Rocca, Jerzy Tiuryn, Pawel Urzyczyn: Alpha-Conversion and Typability. Inf. Comput. 150(1): 1-21 (1999) |
| 36 | | Mariangiola Dezani-Ciancaglini, Jerzy Tiuryn, Pawel Urzyczyn: Discrimination by Parallel Observers: The Algorithm. Inf. Comput. 150(2): 153-186 (1999) |
| 35 | | Pawel Urzyczyn: The Emptiness Problem for Intersection Types. J. Symb. Log. 64(3): 1195-1215 (1999) |
| 1997 | ||
| 34 | | Mariangiola Dezani-Ciancaglini, Jerzy Tiuryn, Pawel Urzyczyn: Discrimination by Parallel Observers. LICS 1997: 396-407 |
| 33 | | Pawel Urzyczyn: Inhabitation in Typed Lambda-Calculi (A Syntactic Approach). TLCA 1997: 373-389 |
| 32 | | 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) |
| 31 | | Pawel Urzyczyn: Type Reconstruction in Fomega. Mathematical Structures in Computer Science 7(4): 329-358 (1997) |
| 1996 | ||
| 30 | | Jerzy Tiuryn, Pawel Urzyczyn: The Subtyping Problem for Second-Order Types is Undecidable. LICS 1996: 74-85 |
| 29 | | Pawel Urzyczyn: Positive Recursive Type Assignment. Fundam. Inform. 28(1-2): 197-209 (1996) |
| 1995 | ||
| 28 | | Pawel Urzyczyn: Positive Recursive Type Assignment. MFCS 1995: 382-391 |
| 1994 | ||
| 27 | | Steffen van Bakel, Luigi Liquori, Simona Ronchi Della Rocca, Pawel Urzyczyn: Comparing Cubes. LFCS 1994: 353-365 |
| 26 | | Pawel Urzyczyn: The Emptiness Problem for Intersection Types LICS 1994: 300-309 |
| 25 | | A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn: An Analysis of ML Typability. J. ACM 41(2): 368-398 (1994) |
| 1993 | ||
| 24 | | Pawel Urzyczyn: Type reconstruction in F-omega is undecidable. TLCA 1993: 418-432 |
| 23 | | 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) |
| 22 | | Pawel Urzyczyn: Primitive Recursion with Extential Types. Fundam. Inform. 19(1/2): 201-222 (1993) |
| 21 | | A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn: The Undecidability of the Semi-unification Problem Inf. Comput. 102(1): 83-101 (1993) |
| 1992 | ||
| 20 | | 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) |
| 1990 | ||
| 19 | | A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn: ML Typability is DEXTIME-Complete. CAAP 1990: 206-220 |
| 18 | | A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn: The Undecidability of the Semi-Unification Problem (Preliminary Report) STOC 1990: 468-476 |
| 1989 | ||
| 17 | | A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn: Computational Consequences and Partial Solutions of a Generalized Unification Problem (Partial Report) LICS 1989: 98-105 |
| 16 | | A. J. Kfoury, Pawel Urzyczyn: Algo-Like Languages with Higher-Order Procedures and Their Expressive Power. Logic at Botik 1989: 186-199 |
| 1988 | ||
| 15 | | A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn: On the Computational Power of Universally Polymorphic Recursion LICS 1988: 72-81 |
| 14 | | A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn: A Proper Extension of ML with an Effective Type-Assignment. POPL 1988: 58-69 |
| 13 | | Jerzy Tiuryn, Pawel Urzyczyn: Some Relationships Between Logics of Programs and Complexity Theory. Theor. Comput. Sci. 60: 83-108 (1988) |
| 1987 | ||
| 12 | | Wojciech Kowalczyk, Pawel Urzyczyn: Verification of Programs with Higher-Order Arrays. FCT 1987: 251-258 |
| 11 | | A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn: The Hierarchy of Finitely Typed Functional Programs (Short Version) LICS 1987: 225-235 |
| 1986 | ||
| 10 | | Pawel Urzyczyn: "During" Cannot be Expressed by "After". J. Comput. Syst. Sci. 32(1): 97-104 (1986) |
| 1985 | ||
| 9 | | A. J. Kfoury, Pawel Urzyczyn: Necessary and Sufficient Conditions for the Universality of Programming Formalisms. Acta Inf. 22(4): 347-377 (1985) |
| 1984 | ||
| 8 | | Jerzy Tiuryn, Pawel Urzyczyn: Remarks on Comparing Expressive Power of Logics of Programs. MFCS 1984: 535-543 |
| 1983 | ||
| 7 | | Pawel Urzyczyn: Deterministic Context-Free Dynamic Logic is More Expressive than Deterministic Dynamic Logic of Regular Programs. FCT 1983: 498-504 |
| 6 | | Jerzy Tiuryn, Pawel Urzyczyn: Some Relationships between Logics of Programs and Complexity Theory (Extended Abstract) FOCS 1983: 180-184 |
| 5 | | A. J. Kfoury, Pawel Urzyczyn: Necessary and Sufficient Conditions for University of Programming Formalisms (Partial Report). Logic of Programs 1983: 279-289 |
| 4 | | 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) |
| 3 | | Pawel Urzyczyn: Nontrivial Definability by Flow-Chart Programs Information and Control 58(1-3): 59-87 (1983) |
| 1981 | ||
| 2 | | Pawel Urzyczyn: Algorithmic triviality of abstract structures. Fundam. Inform. 4(4): 819-850 (1981) |
| 1 | | Pawel Urzyczyn: The Unwind Property in Certain Algebras Information and Control 50(2): 91-109 (1981) |
| 1 | Steffen van Bakel | [27] [32] |
| 2 | Viviana Bono | [44] |
| 3 | Mariangiola Dezani-Ciancaglini (Mariangiola Dezani) | [34] [36] |
| 4 | Anna Gambin | [55] |
| 5 | Martin Hofmann | [46] |
| 6 | Assaf J. Kfoury (A. J. Kfoury) | [5] [9] [11] [14] [15] [16] [17] [18] [19] [20] [21] [23] [25] [37] |
| 7 | Teodor Knapik | [39] [42] [47] |
| 8 | Wojciech Kowalczyk | [12] |
| 9 | Agnieszka Kozubek | [50] |
| 10 | Rastislav Kralovic (Rastislav Královic) | [49] |
| 11 | Luigi Liquori | [27] [32] |
| 12 | Damian Niwinski | [39] [42] [47] [55] |
| 13 | Laurent Regnier | [41] |
| 14 | Jakob Rehof | [56] [57] |
| 15 | Simona Ronchi Della Rocca | [27] [32] [37] |
| 16 | Morten Heine Sørensen | [51] [53] |
| 17 | Zdzislaw Splawski | [38] |
| 18 | Jerzy Tiuryn | [6] [8] [11] [13] [14] [15] [17] [18] [19] [20] [21] [23] [25] [30] [34] [36] [37] [40] [44] |
| 19 | Igor Walukiewicz | [47] |
Colors in the list of coauthors
Last update Fri May 25 01:42:58 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page