Counting and generating terms in the binary lambda calculus

In a paper, entitled Binary lambda calculus and combinatory logic, John Tromp presents a simple way of encoding lambda calculus terms as binary sequences. In what follows, we study the numbers of binary strings of a given size that represent lambda terms and derive results from their generating func...

Full description

Saved in:
Bibliographic Details
Published in:Journal of functional programming Vol. 25
Main Authors: GRYGIEL, KATARZYNA, LESCANNE, PIERRE
Format: Journal Article
Language:English
Published: Cambridge, UK Cambridge University Press 01.01.2015
Cambridge University Press (CUP)
Subjects:
ISSN:0956-7968, 1469-7653
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Be the first to leave a comment!
You must be logged in first