Asymptotics and random sampling for BCI and BCK lambda terms
Authors:
- 1 September 2013
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 502, 227-238
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- An optimal algorithm to generate rooted trivalent diagrams and rooted triangular mapsTheoretical Computer Science, 2010
- Analytic combinatoricsChoice Reviews Online, 2009
- Classical and Intuitionistic Logic Are Asymptotically Identical2007
- Boltzmann Samplers for the Random Generation of Combinatorial StructuresCombinatorics, Probability and Computing, 2004
- Analytic Variations on the Airy DistributionAlgorithmica, 2001
- Statistical properties of simple typesMathematical Structures in Computer Science, 2000
- On the Analysis of Linear Probing HashingAlgorithmica, 1998
- Une théorie combinatoire des séries formellesAdvances in Mathematics, 1981
- The asymptotic number of labeled graphs with given degree sequencesJournal of Combinatorial Theory, Series A, 1978
- Asymptotic Methods in EnumerationSIAM Review, 1974