HAL (France)
open access
Enumerating lambda terms by weighted length of their De Bruijn representation
John Tromp introduced the so-called ‘binary lambda calculus’ as a way to encode lambda terms in terms of 0–1-strings using the de Bruijn representation along with a weighting scheme. Later, Grygiel and Lescanne conjectured that the number of binary lambda terms with m free indices and of size n (enc
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Positive formulas for q-Zeta numerators of Ferrers-cell posets#1050955
- Typed Template Fuzzing#1424460
- Typed Template Fuzzing#1417891
- A Twelve-Row Seed and a One-Row Extension for Five-Column Recursive-Line Zarankiewicz Numbers#1117903
- S - The Set Where Counting is Impossible#81767
Record · ID 1479950
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive