Presentation 2001/3/9
Treatment of Types in the framework of Combinatory Logic and its calculation using Graph Transformation System
Yoshio SUGITO,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) 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.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Type / Lambda Calculus / Combinatory Logic / Graph Transformation
Paper # SS2000-57
Date of Issue

Conference Information
Committee SS
Conference Date 2001/3/9(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Software Science (SS)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Treatment of Types in the framework of Combinatory Logic and its calculation using Graph Transformation System
Sub Title (in English)
Keyword(1) Type
Keyword(2) Lambda Calculus
Keyword(3) Combinatory Logic
Keyword(4) Graph Transformation
1st Author's Name Yoshio SUGITO
1st Author's Affiliation ELECTROTECHNICAL LABORATORY()
Date 2001/3/9
Paper # SS2000-57
Volume (vol) vol.100
Number (no) 678
Page pp.pp.-
#Pages 8
Date of Issue