Publisher
Springer Science and Business Media LLC
Reference19 articles.
1. Altenkirch T., Coquand T.: A finitary subsystem of the polymorphic lambda calculus. In: Abramsky, S. (ed.) Typed Lambda Calculi and Applications (Lecture Notes in Computer Science 2044), pp. 22–28. Springer, Berlin (2001)
2. Barendregt H.P.: The Lambda Calculus: Its Syntax and Semantics. 2nd edn. North-Holland, Amsterdam (1984)
3. Barendregt H.P. et al.: Lambda calculi with types. In: Abramsky, S. (ed.) Handbook of Logic in Computer Science II, pp. 117–309. Oxford University Press, Oxford (1992)
4. Beckmann A.: Exact bounds for lengths of reduction sequences in typed λ-calculus. J. Symbol. Log. 66, 1277–1285 (2001)
5. Curry H.B., Feys R.: Combinatory Logic I. North-Holland, Amsterdam (1958)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Combinatory logic with polymorphic types;Archive for Mathematical Logic;2021-08-27