The combinator S

DOI10.1006/INCO.2000.2874zbMATH Open1005.03017OpenAlexW2033416236MaRDI QIDQ1854346FDOQ1854346

Authors: Johannes Waldmann 

Publication date: 14 January 2003

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.2000.2874

Recommendations

• scientific article; zbMATH DE number 1189064
• scientific article; zbMATH DE number 1615239
• scientific article; zbMATH DE number 1216018
• Effective reduction and conversion strategies for combinators
• Normal-order reduction grammars

zbMATH Keywords

normal formterm rewriting systemrational tree language

Mathematics Subject Classification ID

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

Cites Work

• The lambda calculus. Its syntax and semantics. Rev. ed.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Decidable approximations of term rewriting systems
• Title not available (Why is that?)
• Title not available (Why is that?)
• The word problem for Smullyan's lark combinator is decidable
• Director strings as combinators
• Church-Rosser strategies in the lambda calculus
• The letter S
• How to decide the lark
• Title not available (Why is that?)

Cited In (12)

• Title not available (Why is that?)
• Mockingbird lattices
• Stathis Zachos at 70!
• Title not available (Why is that?)
• Title not available (Why is that?)
• The kernel strategy and its use for the study of combinatory logic
• Local Termination
• Highlights in infinitary rewriting and lambda calculus
• On repetitive right application of \(B\)-terms
• The combinator M and the Mockingbird lattice
• Disproving termination of non-erasing sole combinatory calculus with tree automata
• How to normalize the Jay

This page was built for publication: The combinator S

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1854346)