| 2008 |
|---|
| 8 | EE | Hirofumi Yokouchi:
Strictness Analysis Algorithms Based on an Inequality System for Lazy Types.
FLOPS 2008: 255-271 |
| 2002 |
|---|
| 7 | EE | Hirofumi Yokouchi:
Completeness of type assignment systems with intersection, union, and type quantifiers.
Theor. Comput. Sci. 272(1-2): 341-398 (2002) |
| 1998 |
|---|
| 6 | | Hirofumi Yokouchi:
Completeness of Type Assignment Systems with Intersection, Union, and Type Quantifiers.
LICS 1998: 368-379 |
| 1995 |
|---|
| 5 | | Hirofumi Yokouchi:
Embedding a Second Order Type System into an Intersection Type System
Inf. Comput. 117(2): 206-220 (1995) |
| 1994 |
|---|
| 4 | | Hirofumi Yokouchi:
F-Semantics for Type Assignment Systems.
Theor. Comput. Sci. 129(1): 39-77 (1994) |
| 1990 |
|---|
| 3 | | Hirofumi Yokouchi,
Teruo Hikita:
A Rewriting System for Categorical Combinators with Multiple Arguments.
SIAM J. Comput. 19(1): 78-97 (1990) |
| 1989 |
|---|
| 2 | | Hirofumi Yokouchi:
Church-Rosser Theorem for a Rewriting System on Categorical Combinators.
Theor. Comput. Sci. 65(3): 271-290 (1989) |
| 1986 |
|---|
| 1 | | Hirofumi Yokouchi:
Retraction Map Categories and Their Applications to the Construction of Lambda Calculus Models
Information and Control 71(1/2): 33-86 (1986) |
