0:00 / 0:00
#microhaskell#combinators#graph-reduction
Lennart Augustsson - MicroHaskell
Chalmers Functional Programming Seminar Series
1.6K subscribers • 2 videos on Hallway
- Recommended by 3 people: 3 in engineering communities.
- Presented by Lennart Augustsson, computer scientist
Advanced. Deep dive for people who know the field.
2.8K views2 years ago3 recommendations
Programming languagesSystems programmingCompilers and interpretersFunctional programmingHaskell
Lennart Augustsson presents MicroHaskell, an implementation of a Haskell subset compiled to combinators and evaluated via graph reduction.
Lennart Augustsson gave a talk in the FP seminars at Chalmers, Gothenburg, about his new MicroHaskell. -- Abstract: MicroHs is an implementation of a subset Haskell that is using combinators; pretty much as described in David Turner's 1979 paper A New Implementation Technique for Applicative Languages. The implementation has very few dependencies, and the binaries can run on almost anything that has a C compiler. The talk will illustrate a few aspects of compiling to combinators.Why it's here
3 people recommend thisWhat people say. Recommended for its deep dive into compiling Haskell to combinators and graph reduction.
u/RobertKentKrookin r/haskell • Recommends
MicroHaskell - Lennart Augustsson
Hi!
Lennart gave a presentation about combinators and graph reduction at the FP seminars at Chalmers a few months ago. He wrote a little implementation to demo at the talk, and just never stopped writing code. Today he came back and gave a presentation about MicroHaskell. It is an "extended subset" of Haskell, which is compiled to combinators and evaluated via graph reduction, implemented by a runtime-system written in 2500 lines of C.
Here is a recording of the presentation: [video
Here is his repo: https://github.com/augustss/MicroHs
I hope some of you find it as interesting as we did :)
Robert
u/mttdin r/Compilers • Recommends
MicroHs: A Small Haskell Compiler - Lennart Augustsson