CombinatorS

CombinatorS

represents the TemplateBox[{}, CombinatorS] combinator.

Details

Examples

open allclose all

Basic Examples  (2)

Apply the standard reduction rules of combinatory logic:

Use the axioms of combinatory logic to prove the TemplateBox[{}, CombinatorS] identity:

Applications  (1)

Prove an identity among combinators:

Properties & Relations  (1)

The TemplateBox[{}, CombinatorS] combinator is equivalent to the term :

Wolfram Research (2020), CombinatorS, Wolfram Language function, https://reference.wolfram.com/language/ref/CombinatorS.html.

Text

Wolfram Research (2020), CombinatorS, Wolfram Language function, https://reference.wolfram.com/language/ref/CombinatorS.html.

CMS

Wolfram Language. 2020. "CombinatorS." Wolfram Language & System Documentation Center. Wolfram Research. https://reference.wolfram.com/language/ref/CombinatorS.html.

APA

Wolfram Language. (2020). CombinatorS. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/ref/CombinatorS.html

BibTeX

@misc{reference.wolfram_2025_combinators, author="Wolfram Research", title="{CombinatorS}", year="2020", howpublished="\url{https://reference.wolfram.com/language/ref/CombinatorS.html}", note=[Accessed: 21-February-2025 ]}

BibLaTeX

@online{reference.wolfram_2025_combinators, organization={Wolfram Research}, title={CombinatorS}, year={2020}, url={https://reference.wolfram.com/language/ref/CombinatorS.html}, note=[Accessed: 21-February-2025 ]}