Asymptotics and random sampling for BCI and BCK lambda terms

From MaRDI portal
Publication:391429


DOI10.1016/j.tcs.2013.01.008zbMath1297.68184MaRDI QIDQ391429

Olivier Bodini, Alice Jacquot, Daniéle Gardy

Publication date: 10 January 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2013.01.008


68R05: Combinatorics in computer science

05A16: Asymptotic enumeration

03B47: Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics)

03B40: Combinatory logic and lambda calculus


Related Items



Cites Work