On the Number of Lambda Terms With Prescribed Size of Their De Bruijn Representation
暂无分享,去创建一个
[1] Pierre Lescanne,et al. Counting and generating lambda terms , 2012, Journal of Functional Programming.
[2] Pierre Lescanne,et al. Counting Terms in the Binary Lambda Calculus , 2014, ArXiv.
[3] de Ng Dick Bruijn. Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem , 1972 .
[4] John Tromp. Binary Lambda Calculus and Combinatory Logic , 2006, Kolmogorov Complexity and Applications.
[5] Philippe Flajolet,et al. Singularity Analysis of Generating Functions , 1990, SIAM J. Discret. Math..
[6] Pierre Lescanne,et al. A Natural Counting of Lambda Terms , 2016, SOFSEM.
[7] Philippe Flajolet,et al. Analytic Combinatorics , 2009 .
[8] de Ng Dick Bruijn,et al. Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem , 1972 .
[9] Danièle Gardy,et al. Lambda-terms of Bounded Unary Height , 2011, ANALCO.