The word problem for Smullyan's lark combinator is decidable

DOI10.1016/S0747-7171(89)80044-6zbMath0663.03004MaRDI QIDQ1114668

Richard Statman

Publication date: 1989

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

zbMATH Keywords

applicative combinatorsBWBlark combinatorparadoxical combinator

Mathematics Subject Classification ID

Decidability (number-theoretic aspects) (11U05) Combinatory logic and lambda calculus (03B40)

Related Items (7)

The combinator M and the Mockingbird lattice ⋮ Unnamed Item ⋮ Mockingbird lattices ⋮ How to decide the lark ⋮ Unnamed Item ⋮ Displaying and deciding substructural logics. I: Logics with contraposition ⋮ The combinator S

Cites Work

• Combinatory logic. With two sections by William Craig.
• A foray into combinatory logic
• The lambda calculus, its syntax and semantics
• Unnamed Item
• Unnamed Item

This page was built for publication: The word problem for Smullyan's lark combinator is decidable