From Newsgroup: comp.theory


i like lambda calculus.
but... do you like lambda calculus?
anyways, look at what i made: https://github.com/Zaydiscool777/pdfs/blob/main/lambda/lambda.pdf
--
https://zaydiscool777.github.io/index.html
https://beacons.ai/zaydiscool777 <- list of links, not actually ai [email protected]
--- Synchronet 3.22a-Linux NewsLink 1.2

From Newsgroup: comp.theory

Zayd Mohammed <[email protected].1> wrote:

i like lambda calculus.
but... do you like lambda calculus?

LC is fascinating.

AIT
Algorithmic Information Theory, using Binary Lambda Calculus <https://github.com/tromp/AIT>
<https://tromp.github.io/cl/diagrams.html>
<https://tromp.github.io/cl/LC.pdf>

2swap
What is PLUS times PLUS?
<https://youtu.be/RcVA8Nj6HEo>
--
Fleetwood Mac
Tusk 1979 Disco Purrfection Version <https://www.youtube.com/watch?v=ypvjcouRb_M>
--- Synchronet 3.22a-Linux NewsLink 1.2

From Newsgroup: comp.theory

On Fri, 12 Jun 2026 20:33:49 -0000 (UTC), Zayd Mohammed wrote:

i like lambda calculus.

I like traffic lights. But only when they’re green.

Q: Make a sentence with “lambda calculus”.
A: I like lambda calculus.
--- Synchronet 3.22a-Linux NewsLink 1.2

From Newsgroup: comp.theory

On 6/12/2026 3:33 PM, Zayd Mohammed wrote:

i like lambda calculus.
but... do you like lambda calculus?
anyways, look at what i made: https://github.com/Zaydiscool777/pdfs/blob/main/lambda/lambda.pdf

Richard Montague's Grammar of natural language semantics:
Lambda calculus (specifically typed lambda calculus) is the mathematical
glue Montague used to combine word meanings into full sentence meanings.
--
Copyright 2026 Olcott

My 28 year goal has been to make
"true on the basis of meaning expressed in language"
reliably computable for the entire body of knowledge.
The complete structure of this system is now defined.

The entire body of knowledge expressed in language is
comprised of two types of relations between finite strings:
(a) *Axioms* Expressions of language that are stipulated to be true.

My system bridges the analytic/synthetic distinction by
expressly encoding all empirical "atomic facts" in a formal
language such as CycL of the Cyc project.

(b) *Inference Rules* Expressions of language that are semantically
entailed syntactically from (a) and/or (b).
--- Synchronet 3.22a-Linux NewsLink 1.2

From Newsgroup: comp.theory

On 2026-06-13, Lawrence D’Oliveiro <[email protected]d> wrote:

On Fri, 12 Jun 2026 20:33:49 -0000 (UTC), Zayd Mohammed wrote:

i like lambda calculus.

I like traffic lights. But only when they’re green.

Q: Make a sentence with “lambda calculus”.
A: I like lambda calculus.

that's not a question.
--
https://zaydiscool777.github.io/index.html
https://beacons.ai/zaydiscool777 <- list of links, not actually ai [email protected]
--- Synchronet 3.22a-Linux NewsLink 1.2

From Newsgroup: comp.theory

Lawrence D’Oliveiro <[email protected]d> schrieb:

Q: Make a sentence with “lambda calculus”.

A: Make a sentence with “lambda calculus”.
--- Synchronet 3.22a-Linux NewsLink 1.2

From Newsgroup: comp.theory

Zayd Mohammed <[email protected].1> schrieb:

i like lambda calculus.
but... do you like lambda calculus?
anyways, look at what i made: https://github.com/Zaydiscool777/pdfs/blob/main/lambda/lambda.pdf

Can you share it in plain text form?

Anyway, I like the λ-calculus. I made a λ-calculus interpreter in Haskell. It's
pretty neat, but not very efficient. It might be worth the trouble to add a few more primitives like numbers just for efficiency.

My interpreter uses indices instead of variables, for example, instead of λx.λy.λz.xz(yz) I would write \\\$$##($##), where # = 0 and $ = succesor function. It uses a $ for each \ a variable skips. This avoids α-difficulties. --- Synchronet 3.22a-Linux NewsLink 1.2

From Newsgroup: comp.theory

On 2026-06-16, Esrimushmoneh <[email protected]> wrote:

Zayd Mohammed <[email protected].1> schrieb:

i like lambda calculus.
but... do you like lambda calculus?
anyways, look at what i made:
https://github.com/Zaydiscool777/pdfs/blob/main/lambda/lambda.pdf

Can you share it in plain text form?

the plain text form is at: https://github.com/Zaydiscool777/pdfs/blob/main/lambda/lambda.tex
(well, techincally that's in Tex.)

Anyway, I like the λ-calculus. I made a λ-calculus interpreter in Haskell. It's
pretty neat, but not very efficient. It might be worth the trouble to add a few
more primitives like numbers just for efficiency.

My interpreter uses indices instead of variables, for example, instead of λx.λy.λz.xz(yz) I would write \\\$$##($##), where # = 0 and $ = succesor function. It uses a $ for each \ a variable skips. This avoids α-difficulties.

so, does that mean you interpreter uses Bruijn indices?
that's cool. although i wonder why you chose to use symbols for 0 and succ, rather than just parsing numbers.
--
https://zaydiscool777.github.io/index.html
https://beacons.ai/zaydiscool777 <- list of links, not actually ai [email protected] <- use this if not replying on usenet
--- Synchronet 3.22a-Linux NewsLink 1.2