scientific article; zbMATH DE number 5252394
From MaRDI portal
Publication:5448306
zbMath1137.68020MaRDI QIDQ5448306
Publication date: 20 March 2008
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
algorithmic information theorylambda calculuscombinatory logicbinary stringsprogram-size complexitybinary representationsparser-interpreters
Functional programming and lambda calculus (68N18) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Prefix, length-variable, comma-free codes (94A45) Combinatory logic and lambda calculus (03B40)
Related Items (7)
Asymptotic Properties of Combinatory Logic ⋮ On some enumerative problems in lambda calculus ⋮ 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 ⋮ Functional programs as compressed data ⋮ Deriving Efficient Sequential and Parallel Generators for Closed Simply-Typed Lambda Terms and Normal Forms ⋮ Statistical properties of lambda terms
This page was built for publication:
