Hirofumi Yokouchi

发表

Completeness of type assignment systems with intersection, union, and type quantifiers

Hirofumi Yokouchi, H. Yokouchi, 1998, Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226).

Embedding a Second Order Type System into an Intersection Type System

Hirofumi Yokouchi, H. Yokouchi, 1995, Inf. Comput..

Retraction Map Categories and Their Applications to the Construction of Lambda Calculus Models

Hirofumi Yokouchi, 1986, Inf. Control..

Church-Rosser Theorem for a Rewriting System on Categorical Combinators

Hirofumi Yokouchi, 1989, Theor. Comput. Sci..

F-Semantics for Type Assignment Systems

Hirofumi Yokouchi, H. Yokouchi, 1994, Theor. Comput. Sci..

Application and Composition in Functional Programming

Hirofumi Yokouchi, 1986 .

GENERAL CONSTRUCTION OF LAMBDA CALCULUS MODELS(Lambda Calculus and Computer Science Theory)

Hirofumi Yokouchi, 1984 .

Completeness of type assignment systems with intersection, union, and type quantifiers

Hirofumi Yokouchi, 2002, Theor. Comput. Sci..

Syntax and Semantics of Type Assignment Systems

Hirofumi Yokouchi, H. Yokouchi, 1998 .

A Rewriting System for Categorical Combinators with Multiple Arguments

Teruo Hikita, Hirofumi Yokouchi, 1990, SIAM J. Comput..

Strictness Analysis Algorithms Based on an Inequality System for Lazy Types

Hirofumi Yokouchi, H. Yokouchi, 2008, FLOPS.