danielszm

I appreciate this very much. Thank you. Will do.

Yes and yes. The source language is a subset of Clojure, a small Lisp. And yes, it is also a library for Clojure. On top of it being a standalone compiler.

It is Friedman and Felleisen's belief "that writing programs recursively in Scheme is essentially simple pattern recognition". (The Little Schemer, Fourth Edition)

I think this sits well with what we know about cognition. Skill acquisition can be treated as a continuum with analytical reasoning lies at one end, and pattern recognition at the other. The more we practice a skill, the less any kind of reasoning is taking place, replaced by heuristics that the brain is excellent at (of which pattern recognition is but one example).

See also Daniel Kahnemann's System 1 and System 2 Thinking.

Greetings fellow developers,

A whirlwind tour that sheds light on the design of web frameworks that emerged in all language communities (Servlets, WSGI or Rack), reflecting the need to standardize around a portable interface abstracting HTTP.

This is a hands-on post via a take on Ring, the standard framework in Clojure. I went to great length documenting the experience of living and breathing at the REPL.

README contains rough examples for a coding assistant, sentiment analysis, spam filters, conversational ai, etc.

This is excellent. Thank you!

John McCarthy said that he never had the intention to realize the lambda calculus, but he followed that statement with the corollary that had someone "started out with that intention, he might have ended with something like LISP." Peter Landin was a pioneer in that regard. See "The Mechanical Evaluation of Expressions", published in 1964, and the SECD virtual machine. Machine interpreters like SECD and CEK may come close to a "realization" of the lambda calculus. Their design is directly inspired by its semantics. You don't necessarily end up with something like LISP, but you can, see Lispkit and LispMe.