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 zaydiscool777@gmail.com
--- Synchronet 3.22a-Linux NewsLink 1.2

From Newsgroup: comp.theory

Zayd Mohammed <zaydm@172.24.208.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 <ldo@nz.invalid> 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 zaydiscool777@gmail.com
--- Synchronet 3.22a-Linux NewsLink 1.2

From Newsgroup: comp.theory

Lawrence D’Oliveiro <ldo@nz.invalid> 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 <zaydm@172.24.208.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 <lambda@dr.com> wrote:

Zayd Mohammed <zaydm@172.24.208.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 zaydiscool777@gmail.com <- use this if not replying on usenet
--- Synchronet 3.22a-Linux NewsLink 1.2

From Newsgroup: comp.theory

On 13/06/2026 03:52, Lawrence D’Oliveiro 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.

\abcdefghijklmnopqrstuvwxyz_.i_like_lambda_calculus
--
Tristan Wibberley

The message body is Copyright (C) 2026 Tristan Wibberley except
citations and quotations noted. All Rights Reserved except that you may,
of course, cite it academically giving credit to me, distribute it
verbatim as part of a usenet system or its archives, and use it to
promote my greatness and general superiority without misrepresentation
of my opinions other than my opinion of my greatness and general
superiority which you _may_ misrepresent. You definitely MAY NOT train
any production AI system with it but you may train experimental AI that
will only be used for evaluation of the AI methods it implements.
--- Synchronet 3.22a-Linux NewsLink 1.2

From Newsgroup: comp.theory

On 16/06/2026 17:20, Esrimushmoneh wrote:

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.

A Peano presentation of De Bruijn references! Nice!
--
Tristan Wibberley

The message body is Copyright (C) 2026 Tristan Wibberley except
citations and quotations noted. All Rights Reserved except that you may,
of course, cite it academically giving credit to me, distribute it
verbatim as part of a usenet system or its archives, and use it to
promote my greatness and general superiority without misrepresentation
of my opinions other than my opinion of my greatness and general
superiority which you _may_ misrepresent. You definitely MAY NOT train
any production AI system with it but you may train experimental AI that
will only be used for evaluation of the AI methods it implements.
--- Synchronet 3.22a-Linux NewsLink 1.2

From Newsgroup: comp.theory

On 16/06/2026 22:57, Zayd Mohammed wrote:

On 2026-06-16, Esrimushmoneh <lambda@dr.com> wrote:

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.

Because of the misplaced "just", perhaps?

Also, one can directly execute '$' and '#' as list(/tree) iteration and dereference operations.
--
Tristan Wibberley

The message body is Copyright (C) 2026 Tristan Wibberley except
citations and quotations noted. All Rights Reserved except that you may,
of course, cite it academically giving credit to me, distribute it
verbatim as part of a usenet system or its archives, and use it to
promote my greatness and general superiority without misrepresentation
of my opinions other than my opinion of my greatness and general
superiority which you _may_ misrepresent. You definitely MAY NOT train
any production AI system with it but you may train experimental AI that
will only be used for evaluation of the AI methods it implements.
--- Synchronet 3.22a-Linux NewsLink 1.2

From Newsgroup: comp.theory

Zayd Mohammed <zaydm@172.24.208.1> schrieb:

On 2026-06-16, Esrimushmoneh <lambda@dr.com> wrote:

Zayd Mohammed <zaydm@172.24.208.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.

Yes, these are De Bruijn indices. They are simpler. De Bruijn indices make λ-calculus finitary. With normal variables you need an infinite set of variables.

Using only 0 and succ makes the language simpler conceptually. Instead of complex rules of positional decimals and the many digits a decimal system has (around 10, if I remember correctly), I now get by with only 2 symbols and simpler rules. No more forgetting what comes after 12 (it's $$$$$$$$$$$$$#). --- Synchronet 3.22a-Linux NewsLink 1.2