Skip to main content

Questions tagged [lambda-calculus]

For challenges pertaining to Lambda Calculus model of computing.

3 votes
1 answer
605 views

The goal of this challenge is to compare how well different programming languages support functional programming, by seeing how much code it takes to implement BLC8, the simplest functional ...
John Tromp's user avatar
  • 1,461
10 votes
6 answers
778 views

A fixed-point combinator is a higher order function \$\mathrm{fix}\$ that returns the fixed point of its argument function. If the function \$f\$ has one or more fixed points, then $$\mathrm{fix} f=f(\...
Legendary Wizard's user avatar
12 votes
6 answers
501 views

Lambda calculus is a system of computation based on single-argument functions; everything in it is such a function. Due to this functional nature, juxtaposition is commonly used to denote function ...
att's user avatar
  • 22.8k
11 votes
5 answers
632 views

Wheat Wizard has once tried to come up with a parsing problem unsuitable for regex, but it failed due to Anders Kaseorg's Perl regex answer. This is the second attempt. Now that we know that Perl ...
Bubbler's user avatar
  • 79.3k
5 votes
1 answer
433 views

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, ...
AviFS's user avatar
  • 2,211
28 votes
6 answers
1k views

The goal of this challenge is to fill a niche that is mostly lacking on this site. In my observations there most parsing verification challenges fall into two categories: Super easy parsing. This ...
Wheat Wizard's user avatar
  • 103k
7 votes
4 answers
350 views

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, ...
Bubbler's user avatar
  • 79.3k
17 votes
2 answers
1k views

Background Lambda calculus is a model of computation using lambda terms. A variable \$x\$ is a lambda term. If \$E\$ is a lambda term, the lambda abstraction \$\lambda x. E\$ is a lambda term. If \$...
Bubbler's user avatar
  • 79.3k
9 votes
3 answers
526 views

Background The fixed-point combinator \$\textsf{fix}\$ is a higher-order function that computes the fixed point of the given function. $$\textsf{fix}\ f = f\ (\textsf{fix}\ f)$$ In terms of ...
Bubbler's user avatar
  • 79.3k
11 votes
1 answer
441 views

BLC (Binary Lambda Calculus) is a binary encoding of untyped lambda calculus which was created to “provide a very simple and elegant concrete definition of descriptional complexity.” What are some ...
user avatar
3 votes
0 answers
276 views

Not an interpreter. Arguably a compiler. But I'm talking about a transpiler. It can be in any language, but it must return js-valid arrow notation code. The λ-calculus string would be passed as an ...
towc's user avatar
  • 344
22 votes
1 answer
2k views

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 ...
Esolanging Fruit's user avatar
5 votes
1 answer
688 views

The lambda calculus is a system of functional programming. Lambda calculus consists of variables, abstractions, and applications. A variable is simply a name denoting a function parameter. It is a ...
Esolanging Fruit's user avatar
9 votes
4 answers
622 views

Background Visualizing λ-calculus terms Famous lambda-juggler (and code golfer) John Tromp devised an interesting visualization of terms in the λ-calculus. In his words: abstractions (lambdas) are ...
lynn's user avatar
  • 69.7k
10 votes
3 answers
1k views

Write a term on the pure untyped lambda calculus that, when applied to a church-encoded list of numbers, returns it with its numbers sorted in ascending or descending order. Church lists and numbers ...
MaiaVictor's user avatar

15 30 50 per page