|
СТ |
A Sequent Calculus for Subtyping Polymorphic Types |
1996 |
Tiuryn J. |
Lecture Notes in Computer Science |
|
|
Mathematical Foundations of Computer Science 1996 |
11.10.1996 |
|
СТ |
Adding Input-Output to PCF |
1995 |
Tiuryn J., Wand M. |
|
|
|
Proc. of the CS&P 95 Workshop |
07.02.1996 |
|
СТ |
An Analysis of ML Typability |
1994 |
Kfoury A. J., Tiuryn J., Urzyczyn P. |
|
|
|
J. of the ACM |
14.06.1994 |
|
М |
Dynamic Logic |
2000 |
Harel D., Kozen D., Tiuryn J. |
|
|
|
|
11.07.2001 |
|
СТ |
Equational Axiomatization of Bicoercibility for Polymorphic Types |
1995 |
Tiuryn J. |
|
|
|
Lecture Notes in Computer Science |
31.01.1996 |
|
СТ |
Logics of Programs |
1994 |
Kozen D., Tiuryn J. |
|
|
|
Handbook of Theoretical Computer Science. Formal Models and Semantics. Volume B |
27.01.1998 |
|
СТ |
On the Expressive Power of Finitely Typed and Universally Polymorphic Recursive Procedures |
1992 |
Kfoury A. J., Tiuryn J., Urzyczyn P. |
|
|
|
Theoretical Computer Science |
29.02.1992 |
|
СТ |
Type Reconstruction with Recursive Types and Atomic Subtyping |
1993 |
Tiuryn J., Wand M. |
|
|
|
Lecture Notes in Computer Science |
26.05.1993 |
