raganwald.com
@raganwald.functional.cafe.ap.brid.gy
Reg "raganwald" Braithwaite's account for discussing functional programming and shamelessly plugging essays about programming. Follows are NOT endorsements. This […] 🌉 bridged from ⁂ https://functional.cafe/@raganwald, follow @ap.brid.gy to interact
As delightfully shown in Raymond Smullyan’s classic “To Mock a Mockingbird,” if a combinatorial forest has both a starling and a kestrel, it also has every other combinatorial bird: https://archive.org/details/tomockmockingbir00smul_0 And as go […] [Original post on functional.cafe]
![// [C] [B] [A] s == [[C] B] [C] A
export const s = combinator((C: Quotation, B: Quotation, A: Quotation) => [ [C, ...B], C, ...A ]);
export const starling = s;
// [B] [A] k == A
export const k = combinator((B: Quotation, A: Quotation) => [ ...A ]);
export const kestrel = k;](https://cdn.bsky.app/img/feed_thumbnail/plain/did:plc:tdu2ua5n5twpnw3w3nzqe6pq/bafkreiewblb5opxs26itxj3mpszjaqyic6qmei2u7xic7zofmw7ujli27a)
This is, of course, a game in the same game theory family as “The Prisoner’s Dilemma.” North American roads are the board for an n-player “Arms Race.” https://archive.org/details/prisonersdilemma0000poun
JSJ Book Club: “JavaScript Allongé with Reginald Braithwaite,” 2013-08-09 My how the time has flown! ⌚️🪽 https://topenddevs.com/podcasts/javascript-jabber/070-jsj-book-club-javascript-allonge-with-reginald-braithwaite
070 JSJ Book Club: JavaScript Allongé with Reginald Braithwaite · Top End Devs
topenddevs.com
Church numerals in concatenative combinators have begun to manifest themselves.
![test("zn", () => {
expect(z0([ [z0], [z1] ])).toEqual([ z0 ]);
expect(z1([ [z0], [z1] ])).toEqual([ [ z0 ], z1 ]);
expect(z2([ [z0], [z1] ])).toEqual([ [ [ z0 ], z1 ], z1 ]);
expect(z3([ [z0], [z1] ])).toEqual([ [ [ [ z0 ], z1 ], z1 ], z1 ]);
expect(z4([ [z0], [z1] ])).toEqual([ [ [ [ [ z0 ], z1 ], z1 ], z1 ], z1 ]);
expect(z5([ [z0], [z1] ])).toEqual([ [ [ [ [ [ z0 ], z1 ], z1 ], z1 ], z1 ], z1 ]);
expect(z6([ [z0], [z1] ])).toEqual([ [ [ [ [ [ [ z0 ], z1 ], z1 ], z1 ], z1 ], z1 ], z1 ]);
expect(z7([ [z0], [z1] ])).toEqual([ [ [ [ [ [ [ [ z0 ], z1 ], z1 ], z1 ], z1 ], z1 ], z1 ], z1 ]);
expect(z8([ [z0], [z1] ])).toEqual([ [ [ [ [ [ [ [ [ z0 ], z1 ], z1 ], z1 ], z1 ], z1 ], z1 ], z1 ], z1 ]);
expect(z9([ [z0], [z1] ])).toEqual([ [ [ [ [ [ [ [ [ [ z0 ], z1 ], z1 ], z1 ], z1 ], z1 ], z1 ], z1 ], z1 ], z1 ]);
});](https://cdn.bsky.app/img/feed_thumbnail/plain/did:plc:tdu2ua5n5twpnw3w3nzqe6pq/bafkreiapiw4qcccf7ewmttazpi2to3256jdzxj7zdcoe7fodxrwtqy2a7y)
The inner implementation of a base concatenative combinator, `cons`:
![// [B] [A] cons == [[B] A]
export const cons = combinator((B: Parameter, A: Parameter) => {
if (!isProgram(A)) return Fail;
if (!isProgram(B)) return Fail;
if (A.length === 0) return Fail;
if (B.length === 0) return Fail;
return [ [B, ...A] ];
});](https://cdn.bsky.app/img/feed_thumbnail/plain/did:plc:tdu2ua5n5twpnw3w3nzqe6pq/bafkreicgxmuu5kwdyqocdlvbzzrpniq3cw4abij4wgin4bice4fxudygga)
Three articles about Concatenative Combinators from Remo Dentato: https://dev.to/rdentato/series/28789
Concatenative Combinators Series' Articles
View Concatenative Combinators Series' Articles on DEV Community
dev.to
Tony Hoare, as usually quoted: “There are two ways of constructing a software design: One way is to make it so simple that there are obviously no deficiencies and the other way is to make it so complicated that there are no obvious deficiencies. “The first method is far more difficult.” The […]
Original post on functional.cafe
functional.cafe
Exactly this: Function colours are all about the scope of dependency. https://jerf.org/iri/post/2026/func_args_are_not_colors/
Why Function Arguments Are Not Function Colors - iRi
jerf.org
“This article describes a new theory of combinators, similar in many ways to the theory of Combinatory Logic pioneered by Haskell Curry and others in the 1930s... “The inspiration for this theory came from the programming language Joy, designed by Manfred von Thun... “In fact, the theory here […]
Original post on functional.cafe
functional.cafe
“The string is a stark data structure and everywhere it is passed there is much duplication of process. It is a perfect vehicle for hiding information.” —Epigrams in Programming by Dr. Alan J. Perlis (1982) https://www.cs.yale.edu/homes/perlis-alan/quotes.html
“In this post, I want to swoon about macros, explain what "homoiconic" actually means, demonstrate their ubiquity in Elisp, depict their beauty on a detour through Hofstadter's strange loops and Escher's prints, and finally show off some tooling (macroexpand, emacs-lisp-macroexpand, macrostep) […]
Original post on functional.cafe
functional.cafe
Piet is a graphical esolang where some programs look like Mondrian paintings. Naturally, someone has decided to make a quine in Piet, solving two nerdy problems at once. https://www.youtube.com/watch?v=GwMtzhjCzyc
(), pronounced "parens", is a daughter of Iota in which source code consists entirely of '(' and ')'. It is a subset of Balanced Parentheses which encodes Iota programs. https://esolangs.org/wiki/()
Esolang, the esoteric programming languages wiki
esolangs.org
(()), also known as Empty Nest, is a string re-writing scheme designed to use only properly nested parenthesis, and to be completely impossible to read. The syntax is very simple. Every program consists of a list of productions, with the last item being the data. The interpreter iterates […]
Original post on functional.cafe
functional.cafe
An essay of mine from 2013: "When FP? And when OOP?" https://raganwald.com/2013/04/08/functional-vs-OOP.html The underlying idea was that FP and OOP make different kinds of changes easy versus hard. Thus, every application had a little of column A and a little of column B, and what went in […]
Original post on social.bau-ha.us
social.bau-ha.us
“The design of a Joy interpreter written in Joy:” https://hypercubed.github.io/joy/html/jp-joyjoy.html If you have a certain type of brain, you've just been deeply nerd-sniped. Sorry-not-sorry.
A Joy interpreter written in Joy
hypercubed.github.io
> When I talked about my personal blog, I just called it a blog. There was never a situation where “content” would have conveyed a richer meaning. My website visitors aren’t “traffic”; they’re readers. They don’t “generate engagement”; they send me comments […] [Original post on social.bau-ha.us]
(), pronounced "parens", is a programming language in which source code consists entirely of '(' and ')'. https://esolangs.org/wiki/()
Esolang, the esoteric programming languages wiki
esolangs.org
P′′ (P double prime) is a primitive computer programming language created by Corrado Böhm in 1964 to describe a family of Turing machines. P′′ is formally defined as a set of words on the four-instruction alphabet { R, λ, (, ) } as follows: R and λ are words in P′′; If q₁ and q₂ are words in […]
Original post on functional.cafe
functional.cafe
Atomic Programs of Joy by Manfred von Thun “Joy is a functional programming language based on the composition of functions taking one stack as argument and yielding one stack as value. Stacks can contain values of simple types such as truth values, characters and integers, and values of […]
Original post on functional.cafe
functional.cafe
Exploring Regular Expressions and Finite-State Recognizers… By implementing constructive proofs in code. Part I: https://raganwald.com/2019/09/21/regular-expressions.html Part II: https://raganwald.com/2019/12/17/regular-expressions.html
The MUMPS '76 Primer https://github.com/rochus-keller/MUMPS/blob/main/docs/MUMPS_Primer.adoc Anecdote: I was once the web banking tech lead for a US bank with 3-4 million clients. Yes there was Java. Yes there was Oracle. Yes there was MiddleWare. And yes there was XML. Very J2EE. But buried […]
Original post on functional.cafe
functional.cafe
I'm busy with Balanced Parentheses, but just as APL was opinionated about using characters that weren't available on every English language keyboard, is there an esolang the depends upon Susan Kare's “Cairo” font from 1984?
More algorithm fun using Balanced Parentheses as the McGuffin! https://williamdue.github.io/blog/parallel-parentheses-matching
This space devoted to selling you on reading this book... Has no content. https://raymondsmullyan.com/books/to-mock-a-mockingbird-and-other-logic-puzzles/
To Mock a Mockingbird and Other Logic Puzzles | The Raymond Smullyan Society
To Mock a Mockingbird and Other Logic Puzzles
raymondsmullyan.com
RE: https://mas.to/@deprogrammaticaipsum/116766052997383721 One Saturday a generation ago—2002-11-09—Paul Graham ran a one-day conference for fans of "Lightweight Languages" at MIT. There was a morning keynote, a bunch of presentations, lunch, and afternoon keynote, more presentations, and […]
Original post on functional.cafe
functional.cafe
"This esolang of yours, I presume you brought your favourite JavaScript features over?" Well, I dunno about ✌🏽favourite✌🏽, but yeah, its lists can and often do have holes in them.
![### the list interpretation of balanced parentheses
Chaining cons cells together by the `cdr` pointer creates a list. For example, this is a list of five holes —`()()()()()`—diagrammed to show the links:
```mermaid
graph LR
EmptyPair@{ shape: dbl-circ, label: "()" }
Five(["()()()()()"]) --> Four(["()()()()"])
Four --> Three(["()()()"])
Three --> Two(["()()"])
Two --> EmptyPair
```
We don't call it a list of empty pairs. The pairs we write in text notation are containers, and if the pairs contain empty, than we say this is a list of five holes.
A list of five empty pairs looks like this:
```mermaid
graph TD
EmptyPair@{ shape: dbl-circ, label: "()" }
Five(["(())(())(())(())(())"]) --o EmptyPair
Five --> Four(["(())(())(())(())"])
Four --o EmptyPair
Four --> Three(["(())(())(())"])
Three --o EmptyPair
Three --> Two(["(())(())"])
Two --o EmptyPair
Two --> One(["(())"])
One --o EmptyPair
```](https://cdn.bsky.app/img/feed_thumbnail/plain/did:plc:tdu2ua5n5twpnw3w3nzqe6pq/bafkreiep2bm4ce7kdxdz2k7bg6k4t7rkjzcuuksbjqmd4xo5lkls3kruhe)
