Normal Proofs and Their Grammar

Information and Computation

Volumn 125, Issue 2, 1996, Pages 144-153

  Takahashi, Masako ^a   Akama, Yohji ^a   Hirokawa, Sachio ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0346089929     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1996.0027     Document Type: Article

References (11)

1. Akama, Y. (1991), Number of proofs and tree automaton, manuscript.
2. Berardi, S. (1993), personal communication.
3. Ben-Yelles, C.-B. (1979), "Type-Assignment in the Lambda-Calculus," Ph.D. thesis, University College, Swansea, 1979.
4. Hindly, J. R. (forthcoming), "The Simple Theory of Type Assignment."
5. Hirokawa, S. (1993), The number of proofs for an implicational formula (abstract), J. Symbolic Logic 58, 1117.
6. Hopcroft, J. E., and Ullman, J. D. (1979), "Introduction to Automata Theory, Languages and Computation," Addison-Wesley, Reading, MA.
7. Kurata, T., and Takahashi, M. (1995), Decidable properties of intersection type systems, in "Lecture Notes in Computer Science," Vol. 902, pp. 297-311, Springer-Verlag, Berlin/ New York.
8. Prawitz, D. (1965), "Natural Deduction," Almqvist & Wiksell, Stockholm.
9. Takahashi, M., Akama, Y., and Hirokawa, S. (1994), Normal types and their grammar, in "Lecture Notes in Computer Science," Vol. 789, pp. 465-493, Springer-Verlag, Berlin/ New York.
10. Zaionc, M. (1987), Word operation definable in the typed λ-calculus, Theoret. Comput. Sci. 52, 1-14.
11. Zaionc, M. (1991), λ-definability on free algebras, Ann. Pure Appl. Logic 51, 279-300.