A Flock of Functions: Lambda Calculus and Combinatory Logic in JavaScript | Gabriel Lebec @ DevTalks

preview_player
Показать описание
The Lambda Calculus is a tiny symbol manipulation system which suffices to compute anything Turing-computable. Thanks to this expressive power, LC is woven into the DNA of functional programming languages. In this talk, the surprises and delights of LC and related formalisms are demonstrated through the familiar lens of JavaScript.

Gabriel's slides:

Gist of the Q&A part:

See part II of Gabriel's talk at:

---

Follow us on Twitter:
@smartlyio_devs
Рекомендации по теме
Комментарии
Автор

Interobang spotted!! Nice talk, it made a lot of things clearer, thank you.

DevineLuLinvega
Автор

There is something incredibly daoist about boolean logic and equality expressed as combinators

neilbedwell
Автор

Once thought an idiot bird, later was found to be fond of all other birds and itself. 🥰

helloimwill
Автор

Great talk! I'd probably put Cantor and Gentzen on that historical slide, too (and note that Russell's paradox was noticed by Frege).

DumblyDorr
Автор

Can someone please explain to me λf.ff. In particular the ff after the period. Can this be reduced and if so, how? I don't understand how to understand this 😸

(λf.ff)λa.a = (λa.a)λa.a .. i get it but i don't get it.

Ancipital_
Автор

Google changes people. Hmm or maybe its just age.😶

caosed
Автор

Confusing. Too quick and without order design.

LaureanoLuna
welcome to shbcf.ru