Binary lambda calculus and combinatory logic
From MaRDI portal
algorithmic information theorybinary representationsbinary stringscombinatory logiclambda calculusparser-interpretersprogram-size complexity
Combinatory logic and lambda calculus (03B40) Functional programming and lambda calculus (68N18) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Prefix, length-variable, comma-free codes (94A45)
Recommendations
- Counting terms in the binary lambda calculus
- Counting and generating terms in the binary lambda calculus
- On the number of lambda terms with prescribed size of their de Bruijn representation
- Efficient self-interpretation in lambda calculus
- Enumerating lambda terms by weighted length of their de Bruijn representation
Cited in
(20)- LISP program-size complexity. III
- Enumerating lambda terms by weighted length of their de Bruijn representation
- On the number of unary-binary tree-like structures with restrictions on the unary height
- Finite generation and presentation problems for lambda calculus and combinatory logic
- On some enumerative problems in lambda calculus
- Statistical properties of lambda terms
- Counting terms in the binary lambda calculus
- Gödelization in the lambda calculus
- Asymptotic properties of combinatory logic
- Compact bit encoding schemes for simply-typed lambda-terms
- scientific article; zbMATH DE number 2084341 (Why is no real title available?)
- Every bit counts: the binary representation of typed data and programs
- scientific article; zbMATH DE number 4070860 (Why is no real title available?)
- scientific article; zbMATH DE number 2038177 (Why is no real title available?)
- On the Complexity of the Standard Translation of Lambda Calculus into Combinatory Logic
- Deriving efficient sequential and parallel generators for closed simply-typed lambda terms and normal forms
- Functional programs as compressed data
- Toggling operators in computability logic
- The ineffability of God – a logical approach
- Implementing the Goodstein Function in λ-Calculus
This page was built for publication: Binary lambda calculus and combinatory logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5448306)
