In this video we will see how useful it is to make less decisions in the DSLs and allow the interpreters to drive ALL the necessary design details in a type-safe way so that the DSLs and our programs can remain untouched when the interpreters change.
The commit from this (technically from the next) video is here:
[ Ссылка ]
The code for the entire series is here:
[ Ссылка ]
The Cats' Functor Hierarchy is here:
[ Ссылка ]
Structure and Interpretation of Computer Programs (SICP):
[ Ссылка ]
Oleg Kiselyov's website:
[ Ссылка ]
The "Typed Tagless Final Interpreters" paper from Oleg Kiselyov's website:
[ Ссылка ]
If you decide to follow along with the paper, this might help:
[ Ссылка ]
The "Extensible Denotational Language Specifications" paper by Robert Cartwright and Matthias Felleisen:
[ Ссылка ]
This video is part of the following playlist:
[ Ссылка ]
Table of Contents:
00:00 Introduction
01:00 Adding F[_] to the DSL
06:03 Division with hardcoded Either
08:28 Issues with hardcoding Either into division
09:47 Relation to the todo app
11:54 Adding F[_] to the interpreters
30:26 Adding F[_] to the programs
31:07 Adding F[_] to the main
34:34 Id
Website: [ Ссылка ]
Patreon: [ Ссылка ]
Discord: [ Ссылка ]
Telegram: [ Ссылка ]
Twitter: [ Ссылка ]
GitHub: [ Ссылка ]
LBRY: [ Ссылка ]
Install scripts: [ Ссылка ]
Giter8 templates: [ Ссылка ]
Spotify concentration playlist: [ Ссылка ]
Cheers and Happy Coding!
#tf #Scala #tutorial
