Author:
Bendkowski Maciej,Grygiel Katarzyna,Tarau Paul
Publisher
Springer International Publishing
Reference17 articles.
1. Hindley, J.R., Seldin, J.P.: Lambda-Calculus and Combinators: An Introduction, vol. 13. Cambridge University Press, Cambridge (2008)
2. Barendregt, H.P.: Lambda calculi with types. In: Handbook of Logic in Computer Science, vol. 2. Oxford University Press (1991)
3. Grygiel, K., Lescanne, P.: Counting and generating lambda terms. J. Funct. Program. 23(5), 594–628 (2013)
4. Bodini, O., Gardy, D., Gittenberger, B.: Lambda terms of bounded unary height. In: 2011 Proceedings of the Eighth Workshop on Analytic Algorithmics and Combinatorics (ANALCO), pp. 23–32 (2011)
5. David, R., Grygiel, K., Kozik, J., Raffalli, C., Theyssier, G., Zaionc, M.: Asymptotically almost all $$\lambda $$ -terms are strongly normalizing. Logical Meth. Comput. Sci. 9(1:02), 1–30 (2013)
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Generating Well-Typed Terms That Are Not “Useless”;Proceedings of the ACM on Programming Languages;2024-01-05
2. MUTAGEN: Reliable Coverage-Guided, Property-Based Testing using Exhaustive Mutations;2023 IEEE Conference on Software Testing, Verification and Validation (ICST);2023-04
3. Deriving Theorems in Implicational Linear Logic, Declaratively;Electronic Proceedings in Theoretical Computer Science;2020-09-19
4. Stack-Driven Program Generation of WebAssembly;Programming Languages and Systems;2020
5. Quantitative Aspects of Linear and Affine Closed Lambda Terms;ACM Transactions on Computational Logic;2018-06-28