2022 Developer Survey is open! Take survey.

# Questions tagged [combinatory-logic]

For challenges pertaining to Combinatory Logic model of computing.

16 questions
Filter by
Sorted by
Tagged with
18 votes
1 answer
645 views

### Largest SKI output in less than 200 combinators

The Challenge Create an terminating expression in SKI Combinator Calculus in less than 200 combinators (S, K, I) that reduces to the expression with the most combinators. There will be no limit on how ...
• 703
4 votes
0 answers
166 views

### Tips for Golfing the Lambda Calculus & Friends

This includes tips for all related derivatives, as coding in these langs often primarily consists of writing the function in the lambda calculus and then compiling it down at the end. Among others, ...
• 1,921
12 votes
2 answers
915 views

### SKI calculus golf: Hello, World!

Background SKI combinator calculus, or simply SKI calculus, is a system similar to lambda calculus, except that SKI calculus uses a small set of combinators, namely ...
• 62.1k
6 votes
4 answers
185 views

### Ordered, linear, affine, or relevant?

Background Supplementary reading 1, Supplementary reading 2 Linear lambda calculus is a limited form of lambda calculus, where every bound variable must be used exactly once. For example, ...
• 62.1k
17 votes
2 answers
514 views

• 84.9k
22 votes
1 answer
1k views

### Convert λ-expressions to SK-expressions

The λ-calculus, or lambda calculus, is a logical system based on anonymous functions. For example, this a λ-expression: λf.(λx.xx)(λx.f(xx)) However, for the ...
• 14.5k
13 votes
3 answers
735 views

### Combinatory Conundrum!

Introduction: Combinatory Logic Combinatory logic (CL) is based off of things called combinators, which are basically functions. There are two basic "built-in" combinators, ...
• 6,952
24 votes
4 answers
1k views

### Optimizing SKI compiler

The SKI calculus is a variant of the Lambda calculus that doesn't use lambda expressions. Instead, only application and the combinators S, K, and I are used. In this challenge, your task is to ...
• 9,952
12 votes
2 answers
545 views

### Combinator quines

Background You have just learned what combinatory logic is. Intrigued by the various combinators you spend quite a bit of time learning about them. You finally stumble upon this particular expression:...
• 1,485
9 votes
5 answers
352 views

### Write biSp in point-free form using as few terms as possible

The Haskell function biSp has type signature ...
• 935