BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Brazil
1 × Portugal
1 × Serbia
1 × The Netherlands
2 × United Kingdom
3 × Poland
5 × France
5 × USA
Collaborated with:
∅ J.Tiuryn A.J.Kfoury T.Knapik D.Niwinski J.Rehof Z.Splawski A.Schubert K.Zdanowski M.Dezani-Ciancaglini B.Düdder M.Martens I.Walukiewicz
Talks about:
type (9) problem (4) intersect (3) undecid (3) order (3) logic (3) combinatori (2) hierarchi (2) inhabit (2) recurs (2)

Person: Pawel Urzyczyn

DBLP DBLP: Urzyczyn:Pawel

Facilitated 1 volumes:

TLCA 2005Ed

Contributed to:

FoSSaCS 20152015
CSL 20122012
TLCA 20112011
TLCA 20092009
ICALP 20052005
CSL 20042004
FoSSaCS 20022002
TLCA 20012001
ICFP 19991999
LICS 19971997
TLCA 19971997
LICS 19961996
LICS 19941994
TLCA 19931993
STOC 19901990
LICS 19891989
LICS 19881988
POPL 19881988
LICS 19871987

Wrote 19 papers:

FoSSaCS-2015-SchubertUZ #first-order #logic #on the
On the Mints Hierarchy in First-Order Intuitionistic Logic (AS, PU, KZ), pp. 451–465.
CSL-2012-DudderMRU #bound #combinator #logic
Bounded Combinatory Logic (BD, MM, JR, PU), pp. 243–258.
TLCA-2011-RehofU #combinator #finite #logic
Finite Combinatory Logic with Intersection Types (JR, PU), pp. 169–183.
TLCA-2009-Urzyczyn #rank
Inhabitation of Low-Rank Intersection Types (PU), pp. 356–370.
ICALP-2005-KnapikNUW #automaton
Unsafe Grammars and Panic Automata (TK, DN, PU, IW), pp. 1450–1461.
CSL-2004-Urzyczyn
My (Un)Favourite Things (PU), p. 25.
FoSSaCS-2002-KnapikNU #automaton #higher-order
Higher-Order Pushdown Trees Are Easy (TK, DN, PU), pp. 205–222.
TLCA-2001-KnapikNU #algebra #monad
Deciding Monadic Theories of Hyperalgebraic Trees (TK, DN, PU), pp. 253–267.
ICFP-1999-SplawskiU #fixpoint #recursion
Type Fixpoints: Iteration vs. Recursion (ZS, PU), pp. 102–113.
LICS-1997-Dezani-CiancagliniTU #parallel
Discrimination by Parallel Observers (MDC, JT, PU), pp. 396–407.
TLCA-1997-Urzyczyn #approach #λ-calculus
Inhabitation in Typed λ-Calculi (A Syntactic Approach) (PU), pp. 373–389.
LICS-1996-TiurynU #decidability #higher-order #problem #type system
The Subtyping Problem for Second-Order Types is Undecidable (JT, PU), pp. 74–85.
LICS-1994-Urzyczyn #problem
The Emptiness Problem for Intersection Types (PU), pp. 300–309.
TLCA-1993-Urzyczyn #decidability #re-engineering
Type reconstruction in Fω is undecidable (PU), pp. 418–432.
STOC-1990-KfouryTU #problem
The Undecidability of the Semi-Unification Problem (AJK, JT, PU), pp. 468–476.
LICS-1989-KfouryTU #problem #unification
Computational Consequences and Partial Solutions of a Generalized Unification Problem (AJK, JT, PU), pp. 98–105.
LICS-1988-KfouryTU #on the #polymorphism #power of #recursion
On the Computational Power of Universally Polymorphic Recursion (AJK, JT, PU), pp. 72–81.
POPL-1988-KfouryTU #effectiveness #ml
A Proper Extension of ML with an Effective Type-Assignment (AJK, JT, PU), pp. 58–69.
LICS-1987-KfouryTU #functional #source code
The Hierarchy of Finitely Typed Functional Programs (AJK, JT, PU), pp. 225–235.
Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.