( en | de | ru )

 

Disambiguation of "Urzyczyn, Pawel"

Author of the publication

copydeleteadd this publication to your clipboard
Strong cut-elimination in sequent calculus using Klop's iota-translation and perpetual reductions.

, and . J. Symb. Log., 73 (3): 919-932 (2008)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Pawel Urbanski

Pawel Golak

Sascha Pawel

Pawel Durek

Pawel Silberring

 

Other publications of authors with the same name

Strong cut-elimination in sequent calculus using Klop's iota-translation and perpetual reductions., and . J. Symb. Log., 73 (3): 919-932 (2008)ML Typability is DEXTIME-Complete., , and . CAAP, volume 431 of Lecture Notes in Computer Science, page 206-220. Springer, (1990)The Emptiness Problem for Intersection Types. LICS, page 300-309. IEEE Computer Society, (1994)Typed Lambda Calculi and Applications 2003, Selected Papers., and . Fundam. Informaticae, (2005)In the Search of a Naive Type Theory., and . TYPES, volume 4941 of Lecture Notes in Computer Science, page 110-124. Springer, (2007)The Subtyping Problem for Second-Order Types is Undecidable., and . LICS, page 74-85. IEEE Computer Society, (1996)Necessary and Sufficient Conditions for University of Programming Formalisms (Partial Report)., and . Logic of Programs, volume 164 of Lecture Notes in Computer Science, page 279-289. Springer, (1983)Type reconstruction in F-omega is undecidable.. TLCA, volume 664 of Lecture Notes in Computer Science, page 418-432. Springer, (1993)Inhabitation of Low-Rank Intersection Types.. TLCA, volume 5608 of Lecture Notes in Computer Science, page 356-370. Springer, (2009)The Logic of Persistent Intersection.. Fundam. Informaticae, 103 (1-4): 303-322 (2010)