The combinator M and the Mockingbird lattice

DOI10.1017/S0960129522000354MaRDI QIDQ5059139

Samuele Giraudo

Publication date: 23 December 2022

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

latticesrewrite systemsformal power seriespartial orderscombinatory logictreelike structures

Mathematics Subject Classification ID

Computer science (68-XX)

Uses Software

• OEIS

Cites Work

• Combinatory logic. With two sections by William Craig.
• Reduction graphs in the lambda calculus
• The phagocyte lattice of Dyck words
• The word problem for Smullyan's lark combinator is decidable
• The lambda calculus, its syntax and semantics
• How to decide the lark
• Interprétation bijective d'une récurrence des nombres de Motzkin. (Bijective interpretation of a recurrence of Motzkin numbers)
• The combinator S
• Tree series and pattern avoidance in syntax trees
• On generating series of finitely presented operads
• The pruning-grafting lattice of binary trees
• Raymond Smullyan on self reference
• Sur les partitions non croisées d'un cycle. (The non-crossed partitions of a cycle)
• On the likelihood of normalization in combinatory logic
• Minimal and Optimal Computations of Recursive Programs
• Term Rewriting and All That
• Asymptotically almost all \lambda-terms are strongly normalizing
• Tree-Manipulating Systems and Church-Rosser Theorems
• How to normalize the Jay
• Mockingbird lattices
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The combinator M and the Mockingbird lattice