#combinators — Public Fediverse posts

Oh, so we're solving #puzzles now, huh? 🤔 Yeah, let's calculate #factorials without loops, recursion, or common sense. 🌀 Just sprinkle some Y and Z #combinators over that monstrosity and call it a "gentler" introduction. 🙄
https://irfanali.org/blog/zcom #coding #humor #programming #challenges #HackerNews #ngated

Oh, so we're solving #puzzles now, huh? 🤔 Yeah, let's calculate #factorials without loops, recursion, or common sense. 🌀 Just sprinkle some Y and Z #combinators over that monstrosity and call it a "gentler" introduction. 🙄
https://irfanali.org/blog/zcom #coding #humor #programming #challenges #HackerNews #ngated

🧐 Ah, the joy of combing through a #GitHub repo that promises the #thrill of #algebraic #combinators. 🤯 Spoiler alert: it's a maze of #buzzwords and #AI hype, desperately trying to convince you that the future of #coding is as thrilling as watching paint dry. 🎨
https://github.com/remysucre/prela #HackerNews #ngated

🧐 Ah, the joy of combing through a #GitHub repo that promises the #thrill of #algebraic #combinators. 🤯 Spoiler alert: it's a maze of #buzzwords and #AI hype, desperately trying to convince you that the future of #coding is as thrilling as watching paint dry. 🎨
https://github.com/remysucre/prela #HackerNews #ngated

Prela – Purely Algebraic Relation Combinators

https://github.com/remysucre/prela

#HackerNews #Prela #Algebraic #Combinators #GitHub #Programming #Mathematics

Prela – Purely Algebraic Relation Combinators

https://github.com/remysucre/prela

#HackerNews #Prela #Algebraic #Combinators #GitHub #Programming #Mathematics

Combinators

https://tinyapl.rubenverg.com/docs/info/combinators

#HackerNews #Combinators #HackerNews #Programming #FunctionalProgramming #TechNews

Combinators

https://tinyapl.rubenverg.com/docs/info/combinators

#HackerNews #Combinators #HackerNews #Programming #FunctionalProgramming #TechNews

I'm, ehm, yes, unsure.
This might be slop.

It's a song about Moses Schönfinkel and his combinatory logic.

And, I kinda like it.

https://www.youtube.com/watch?v=9tiUCpzMSnY

#logic #combinators #schönfinkel

🤔 So, the magnificent #Wolfram has decreed that we'll all drop everything to ponder whether a single letter, #S, has the mystical power to compute the #universe. 🌌 Who knew #combinators needed a centennial #celebration, complete with a $20,000 participation trophy? 🎉 All hail the new age of combining letters for cash! 💸
https://www.combinatorprize.org/ #cash #prize #HackerNews #ngated

🤔 So, the magnificent #Wolfram has decreed that we'll all drop everything to ponder whether a single letter, #S, has the mystical power to compute the #universe. 🌌 Who knew #combinators needed a centennial #celebration, complete with a $20,000 participation trophy? 🎉 All hail the new age of combining letters for cash! 💸
https://www.combinatorprize.org/ #cash #prize #HackerNews #ngated

"I claimed in the end of the video that this was the first example of animated beta-reductions of visual lambda expressions. Paul Brauner has some videos here: • Lambda Diagrams [1] , although they do not explicitly animate the mechanics of one step of beta-reduction! I probably should have chosen my words more carefully."
https://www.youtube.com/watch?v=RcVA8Nj6HEo
[1]https://www.youtube.com/playlist?list=PLi8_XqluS5xc7GL-bgVrxpA2Uww6nK0gV
#lambdacalculus #combinators #animation #representation #church #tromp #turing

"I claimed in the end of the video that this was the first example of animated beta-reductions of visual lambda expressions. Paul Brauner has some videos here: • Lambda Diagrams [1] , although they do not explicitly animate the mechanics of one step of beta-reduction! I probably should have chosen my words more carefully."
https://www.youtube.com/watch?v=RcVA8Nj6HEo
[1]https://www.youtube.com/playlist?list=PLi8_XqluS5xc7GL-bgVrxpA2Uww6nK0gV
#lambdacalculus #combinators #animation #representation #church #tromp #turing

Oh joy, yet another #C++17 #parser combinator library! 🎉 Because what the world really needed was more creative ways to torture ourselves with syntactic nightmares and verbose error messages. 🚀 GitHub's endless quest to make #programming as enjoyable as a root canal continues unabated. 🙄
https://github.com/foonathan/lexy #combinators #humor #GitHub #developer #woes #HackerNews #ngated

Oh joy, yet another #C++17 #parser combinator library! 🎉 Because what the world really needed was more creative ways to torture ourselves with syntactic nightmares and verbose error messages. 🚀 GitHub's endless quest to make #programming as enjoyable as a root canal continues unabated. 🙄
https://github.com/foonathan/lexy #combinators #humor #GitHub #developer #woes #HackerNews #ngated

“Embedding MicroHs” by Thomas Mahler

https://thma.github.io/posts/2025-08-30-Embedding-MicroHs.html

#Haskell #Combinators

“Embedding MicroHs” by Thomas Mahler

https://thma.github.io/posts/2025-08-30-Embedding-MicroHs.html

#Haskell #Combinators

Parcom: CL Parser Combinators

https://github.com/fosskers/parcom

#HackerNews #Parcom #CL #Parser #Combinators #HackerNews #Programming #Languages #GitHub

Parcom: CL Parser Combinators

https://github.com/fosskers/parcom

#HackerNews #Parcom #CL #Parser #Combinators #HackerNews #Programming #Languages #GitHub

Context free grammars (CFG) are better than parsing expression grammars (PEG), because CFGs represent how we think.

Parser combinators are similar to PEGs, so they are worse than CFGs, too.

So, don't use Rust libraries nom, combine. Use lalrpop.

Don't use Haskell libraries parsec, gigaparsec, attoparsec, megaparsec, trifecta. Use Earley, happy.

See more detailed story in my new article https://safinaskar.writeas.com/this-is-why-you-should-never-use-parser-combinators-and-peg .

The story also includes some cases, where PEG and parser combinators may still be useful. Also, the article gives links to my Haskell parsing libraries.

#haskell #rust #parsing #parse #cfg #peg #combinators #parsercombinators #parsingcombinators #nom #combine #lalrpop #parsec #earley #happy

Context free grammars (CFG) are better than parsing expression grammars (PEG), because CFGs represent how we think.

Parser combinators are similar to PEGs, so they are worse than CFGs, too.

So, don't use Rust libraries nom, combine. Use lalrpop.

Don't use Haskell libraries parsec, gigaparsec, attoparsec, megaparsec, trifecta. Use Earley, happy.

See more detailed story in my new article https://safinaskar.writeas.com/this-is-why-you-should-never-use-parser-combinators-and-peg .

The story also includes some cases, where PEG and parser combinators may still be useful. Also, the article gives links to my Haskell parsing libraries.

#haskell #rust #parsing #parse #cfg #peg #combinators #parsercombinators #parsingcombinators #nom #combine #lalrpop #parsec #earley #happy

Given my difficulties to wrap my head around the Y combinator, I expected it to come with a higher run time penalty. 🙂

#julialang #YCombinator #combinators

Neat!
Short article about Schönfinkel's combinator calculus - in Julia!
https://riptutorial.com/julia-lang/example/20334/the-ski-combinator-system
#schonfinkel #combinators #calculus #julialang

Examples of binary choices where both options seem equally good at first, but really aren't:

When writing parsers using #parser #combinators, consuming trailing whitespace is better than consuming leading whitespace. "Design patterns for parser combinators" https://dl.acm.org/doi/abs/10.1145/3471874.3472984

When writing #E2E #tests, clearing the database before each test is better than clearing it after. "Dangling state is your friend" https://docs.cypress.io/guides/references/best-practices#Dangling-state-is-your-friend

Examples of binary choices where both options seem equally good at first, but really aren't:

When writing parsers using #parser #combinators, consuming trailing whitespace is better than consuming leading whitespace. "Design patterns for parser combinators" https://dl.acm.org/doi/abs/10.1145/3471874.3472984

When writing #E2E #tests, clearing the database before each test is better than clearing it after. "Dangling state is your friend" https://docs.cypress.io/guides/references/best-practices#Dangling-state-is-your-friend

#Propositions As #Types • 1
• https://inquiryintoinquiry.com/2013/01/29/propositions-as-types-1/

One of my favorite mathematical tricks — it almost seems too tricky to be true — is the #PropositionsAsTypesAnalogy. And I see hints the 2-part analogy can be extended to a 3-part analogy, as follows.

\(\text{proof hint : proof : proposition :: untyped term : typed term : type}\)

See my notes on #PropositionsAsTypes for more.
• https://oeis.org/wiki/Propositions_As_Types_Analogy

#Logic #Combinators #ProofTheory #TypeTheory
#CurryHowardIsomorphism #LambdaCalculus

#Propositions As #Types • 1
• https://inquiryintoinquiry.com/2013/01/29/propositions-as-types-1/

One of my favorite mathematical tricks — it almost seems too tricky to be true — is the #PropositionsAsTypesAnalogy. And I see hints the 2-part analogy can be extended to a 3-part analogy, as follows.

\(\text{proof hint : proof : proposition :: untyped term : typed term : type}\)

See my notes on #PropositionsAsTypes for more.
• https://oeis.org/wiki/Propositions_As_Types_Analogy

#Logic #Combinators #ProofTheory #TypeTheory
#CurryHowardIsomorphism #LambdaCalculus

@tapani the only thing I would have done differently if I was writing it today, I'd use #parser #combinators for https://github.com/manpages/py-ken/blob/master/parser.py, moved program entry point to `main.py` and removed all the dead WIP code like `solver.py`.