Normal-order reduction grammars

DOI10.1017/S0956796816000332zbMath1418.68111arXiv1603.01758OpenAlexW2964182341MaRDI QIDQ5372004

Maciej Bendkowski

Publication date: 23 October 2017

Published in: Journal of Functional Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1603.01758

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Combinatory logic and lambda calculus (03B40)

Related Items (3)

On the enumeration of closures and environments with an application to random generation ⋮ Unnamed Item ⋮ Unnamed Item

Uses Software

• Miranda

Cites Work

• Unnamed Item
• Unnamed Item
• The lambda calculus. Its syntax and semantics. Rev. ed.
• A Natural Counting of Lambda Terms
• Non-idempotent intersection types and strong normalisation
• Asymptotic Properties of Combinatory Logic
• A new implementation technique for applicative languages
• 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
• Counting and generating terms in the binary lambda calculus
• Counting and generating lambda terms

This page was built for publication: Normal-order reduction grammars