scientific article; zbMATH DE number 7359407
From MaRDI portal
Publication:4993337
DOI10.4230/LIPICS.FSCD.2018.11zbMath1462.68020MaRDI QIDQ4993337
Pierre Lescanne, Maciej Bendkowski
Publication date: 15 June 2021
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Combinatorics in computer science (68R05) Functional programming and lambda calculus (68N18) Combinatory logic and lambda calculus (03B40)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Call-by-name, call-by-value and the \(\lambda\)-calculus
- A calculus for the random generation of labelled combinatorial structures
- (Leftmost-Outermost) Beta Reduction is Invariant, Indeed
- On Constructor Rewrite Systems and the Lambda Calculus
- Analysing the complexity of functional programs: higher-order meets first-order
- On the likelihood of normalization in combinatory logic
- Singularity Analysis of Generating Functions
- Smoothed analysis of algorithms
- GFUN
- Confluence properties of weak and strong calculi of explicit substitutions
- Concepts in Programming Languages
- Combinatorics of $\lambda$-terms: a natural approach
- On the number of lambda terms with prescribed size of their De Bruijn representation
- Boltzmann Samplers for the Random Generation of Combinatorial Structures
- Asymptotically almost all \lambda-terms are strongly normalizing
- Lambda terms of bounded unary height
- Polynomial tuning of multiparametric combinatorial samplers
- Counting and generating terms in the binary lambda calculus
- Normal-order reduction grammars
- Closing the Gap Between Runtime Complexity and Polytime Computability.
- The Mechanical Evaluation of Expressions
This page was built for publication:
