A relation between the size of term and the number of reduction steps in lambda calculus computations
スポンサーリンク
概要
著者
関連論文
- Number of Proofs for Implicational Formulas(MATHEMATICAL LOGIC AND ITS APPLICATIONS)
- ONE-STEP RECURRENT TERMS IN $\lambda - \beta$-CALCULUS(Algorithms : Mathematical Foundations and Applications)
- Complexity of Combinator Reduction Machine(Mathematical Foundations of Computer Science and Their Applications)
- A relation between the size of term and the number of reduction steps in lambda calculus computations
- One-Step Recurrent Term in $\lambda$-Calculus (形式言語理論とオ-トマトン理論)