Dining Philosophers (1/3) - Introduction
This video presents a computer science classic originally proposed by Dijkstra in 1965, namely the dining philosophers problem.
Throughout this tutorial, we borrow the mantra of type-driven development with Idris, a great and very inspiring book by Edwin Brady: The mantra is type, define, refine. In our context, this means that we will start sketching the code structure, we will test for its behavior and then we will refine it so that it meets our goals.
Видео Dining Philosophers (1/3) - Introduction канала Jelle Herold
Throughout this tutorial, we borrow the mantra of type-driven development with Idris, a great and very inspiring book by Edwin Brady: The mantra is type, define, refine. In our context, this means that we will start sketching the code structure, we will test for its behavior and then we will refine it so that it meets our goals.
Видео Dining Philosophers (1/3) - Introduction канала Jelle Herold
Показать
Комментарии отсутствуют
Информация о видео
Другие видео канала
(Zwanziger) - Natural Model Semantics for Comonadic and Adjoint Modal Type TheoryACT2018: Samson Abramsky — Games and constraint satisfaction (1/2)Morphisms of open games1st Statebox Summit — Oicos DemoBrendan Fong...(Spivak/Wisnesky) — CONEXUS(Behr) — Tracelets and Tracelet Analysis Of Compositional Rewriting SystemsJules Hedges — Tutorial on Open GamesCashing in on Statebox - Josh HarveyPawel Sobocinski — Conjunctive Queries[3S2] Tutorial: Indexed Containers, (Frederik Nordval)Ethical Computing and Natural Systems - Matthew Schutte(Abramsky, Barbosa, Karvonen, Mansfield) — A Comonadic View of Simulation and Quantum Resources(Felice, Meichanetzidis, Toumi) - Montague Semantics for Lambek Pregroups[3S2] Brick diagrams1st Statebox Summit — Typedefs.comSmart contract modelled with Petri nets[3S2] Meta-Cedille (Andre Knispel)deltarobot_kinematics_working.mov1st Statebox Summit — Formal Verifcation Theory