Author:
Fujita Ken-etsu,Kashima Ryo,Komori Yuichi,Matsuda Naosuke
Publisher
Springer Science and Business Media LLC
Subject
History and Philosophy of Science,Logic
Reference17 articles.
1. Andou, Y., A system of $${{\lambda}{\mu}}$$ λ μ -calculus proper to the implicational fragment of classical natural deduction with one conclusion, in RIMS Kokyuroku 976, 1997.
2. Cirstea H. F., Germain K. C.: A $${{\rho}}$$ ρ -calculus of explicit constraint application, Electronic Notes in Theoretical Computer Science 117, 51–67 (2005)
3. Griffin, T. G., A formulae-as-type notion of control, in Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages 1989, 47–58.
4. Hindley, J. R., and J. P. Seldin, Lambda-Calculus and Combinators: An Introduction, Cambridge University Press, Cambridge, 2008.
5. Howard, W. A., The formulae-as-types notion of construction, in To H. B. Curry: Essays on Combinatory Logic, Lambda-Calculus, and Formalism 1980, 479–490.