Cadenza: Building Fast Functional Languages Fast • Edward Kmett • YOW! 2020

This presentation was recorded at YOW! 2020. #GOTOcon #YOW
yowcon.com
Edward Kmett - Fellow & VP of Software Engineering at Groq Inc. ‪@ekmett‬
RESOURCES
/ kmett
github.com/ekmett
comonad.com
ABSTRACT
In this talk Ed will give live coding introduction to normalization by evaluation. He will then show how Graal and Truffle, on the JVM, can be (ab)used to JIT functional languages. He discusses why this seems like a promising direction for evaluating dependently typed languages in particular. [...]
RECOMMENDED BOOKS
Saša Jurić • Elixir in Action • amzn.to/2RZh5eN
Tim McNamara • Rust in Action • amzn.to/3ux2R9u
Ulisses Almeida • Learn Functional Programming with Elixir • amzn.to/389grn6
Neal Ford • Functional Thinking • amzn.to/3DdP35B
Petricek & Skeet • Real-World Functional Programming • amzn.to/38diF4M
Venkat Subramaniam • Functional Programming in Java • amzn.to/2WlOXIt
Cristian Salcescu • Functional Programming in JavaScript • amzn.to/3y75jBS
/ gotocon
/ goto-
/ gotoconferences
#Cadenza #FunctionalProgramming #SoftwareEngineering #Programming #Tech #SoftwareDevelopment #SoftwareTechnology #FP #Haskell #Graal #Truffle #JVM #YOWcon
Looking for a unique learning experience?
Attend the next GOTO conference near you! Get your ticket at gotopia.tech
Sign up for updates and specials at gotopia.tech/newsletter
SUBSCRIBE TO OUR CHANNEL - new videos posted almost daily.
kzbin.info...

[@GOTO-]

We are currently releasing older YOW! videos to serve as a valuable archive, preserving historical content. It is possible that a video is perceived as outdated. We believe it offers insightful glimpses into the past, enriching our understanding of history and development.

[@robchr]

Kotlin is not the language we want but it is the language we deserve.

[@mariobroselli3642]

Scala and then Cadenza 😮

[@kinjalbasu1999]

Are we trying to make a more complicated Lisp machine?

[@zxygentoo1]

That's the price to pay for being fast lol

[@kinjalbasu1999]

@@zxygentoo1 Is it faster though? No one has tried to virtualize a Lisp machine architecture before. Heck, I don't even how anything outside of Von Neuman works 😅😅

[@AlexRodriguez-gb9ez]

@@kinjalbasu1999 Lisp is based on the lambda calculus + some other stuff like semicolons + set statement. Haskell Curry showed how to get rid the need to name things by converting lambdas into combinators (anonymous binding) and they found out that you only needed a few combinators maybe two of them the star apply () combinator and K(const), but others like $, flip, (.), id, map, ++, +, (:), (,), +*, may be useful. You can program the hardware to run the combinator code directly.