| Budget Amount *help |
¥4,030,000 (Direct Cost: ¥3,100,000、Indirect Cost: ¥930,000)
Fiscal Year 2017: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
Fiscal Year 2016: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000)
Fiscal Year 2015: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
|
|---|
| Outline of Final Research Achievements |
The results of this project are the following: (1) We study some fundamental properties of the Lambda-mu calculus, which is a computational model of programming language with stream data. In particular, We propose a new proof technique, called the compositional Z theorem, to prove confluence of the calculus. (2) We show that the compositional Z theorem can be widely applied to prove confluence of several calculi with permutation-like reduction, such as the lambda calculus with direct sum, the lambda calculus with explicit substitutions, and the call-by-value lambda calculus with permutation rules. (3) We propose an intersection-type system for a calculus corresponding to the classical sequent calculus, which reflects the symmetry of classical logic. We show that the system is complete and can characterize the strong normalization.
|
