Introducing Emily Simplifying Functional Programming
summary
Emily is an experimental language that models all operations by composing function‑like combinators with state so everything is a single‑argument combinator and you can represent functions, objects, classes and scopes uniformly. The implementation uses dictionary‑style objects whose fields are atoms and prototype lookup, and a macro layer that rewrites convenient syntax into curried combinator calls so objects are functions and macros rewrite surface syntax. A working interpreter runs the demo programs (abs, sqrt, point.new, prototype inheritance); types remain speculative.
AI-written summary · about
chapters (14)
- 0:00Introduction to Emily
- 1:55Design philosophy
- 3:42Combinator theory
- 5:14Dictionary-based design
- 6:15Objects as functions
- 7:10Constructing the language
- 8:37Core data types
- 10:50Scope and syntax
- 12:26Object literals
- 13:20Example program
- 14:44Syntactic sugar
- 16:57Language capabilities
- 19:23Interoperability
- 20:21Future type system
related talks
44mFunctional Programming You Already Know
49mFunctional Programming Essentials
41mFunctional Programming for Dummies*
42mThe Power of Function Composition
41mFunctional programming: Give it a chance!
41mEvolving Functional Programming Languages
53mY Not- Adventures in Functional Programming
58mKeynote: Why Functional Programming Matters