Treatment of types in the framework of combinatory logic and its calculation using graph transformation system

摘要

In the framework of Lambda Calculus or Combinatory Logic, as for treatment of types there exist two models, that is, one includes types and the other has no type. In this paper, especially forcusing in case of typed Combinatory Logic, we try to execute calculation on types via our graph transformation system (GMS98) as the case study of using and estimating the system.