"A Little Taste of Dependent Types" by David Christiansen

  Рет қаралды 39,712

Strange Loop Conference

Strange Loop Conference

Күн бұрын

Пікірлер: 22
@JulianWasTaken
@JulianWasTaken 4 жыл бұрын
On the incredibly odd chance someone gets just as confused as I was for a few seconds, at 31:44, when he says "that's because ___ curries all of its arguments just like Haskell", the ___ he means is "Pie" (the language they created), not Pi (i.e. Π) the dependent type thing he is confusingly in the middle of explaining. (So all functions in that language get curried, not that Π is somehow doing something special to that lambda function)
@NoNameAtAll2
@NoNameAtAll2 2 жыл бұрын
"Why recursion is not an option?" "Because recursion is not an option!" xD
@andrewsinclair7654
@andrewsinclair7654 6 жыл бұрын
This was my favorite talk from Strangeloop 2018! Thanks David for the amazing presentation, slides, and a book too!
@desjajjaden49
@desjajjaden49 10 ай бұрын
Watched this for literally 5 times, mind-blowing and really nice job!
@AndersBechMellson
@AndersBechMellson 6 жыл бұрын
What an awesome introduction to dependent types. David is such a great presenter!
@-ion
@-ion 6 жыл бұрын
“…ending up with the actual systems that you could sit down and use and type things in” I see what you did there.
@vmguerra
@vmguerra 4 жыл бұрын
"Programs that evaluate to themselves are not the most fun of programs, we will get to some more fun ..ctional programs later"
@oneheckofabanana2016
@oneheckofabanana2016 4 жыл бұрын
Nice talk. I'm looking forward to reading the book and playing with Pie.
@rossgeography
@rossgeography 5 жыл бұрын
so read this book before the little MLer ..? (have read schemer and plan on reading seasoned and reasoned before I go for this)
@CyberneticOrganism01
@CyberneticOrganism01 3 жыл бұрын
Interesting to see type theory in action....
@CyberneticOrganism01
@CyberneticOrganism01 3 жыл бұрын
The "programs" here are used to prove mathematical statements, eg. that a number is either odd or even. If I write a program to calculate the Fibonacci numbers, what is the mathematical statement that this program proved?
@mattetis
@mattetis Жыл бұрын
You would have proved that the Fibonacci numbers exist right? That this is well defined: F0 = 0 F1 = 1 Fn = Fn-1 + Fn-2
@anilraghu8687
@anilraghu8687 4 жыл бұрын
Per Martin Lof Intuitionistic type theory.
@Drumnerd86
@Drumnerd86 6 жыл бұрын
What is the IDE/editor you used for the talk?
@Drumnerd86
@Drumnerd86 6 жыл бұрын
Found out it's just "racket gui/main.rkt" in the pie root folder
@GeorgWilde
@GeorgWilde 3 жыл бұрын
@@Drumnerd86 Hi. The compilation takes a few minutes. Is there a way to skip it next time and run it from the last compilation?
"Proof Theory Impressionism: Blurring the Curry-Howard Line" by Dan Pittman
35:08
Strange Loop Conference
Рет қаралды 12 М.
Type Theory for the Working Rustacean - Dan Pittman
19:24
Rust Belt Rust Conference
Рет қаралды 18 М.
Human vs Jet Engine
00:19
MrBeast
Рет қаралды 207 МЛН
FOREVER BUNNY
00:14
Natan por Aí
Рет қаралды 6 МЛН
What type of pedestrian are you?😄 #tiktok #elsarca
00:28
Elsa Arca
Рет қаралды 17 МЛН
The Hardest Problem in Type Theory - Computerphile
23:40
Computerphile
Рет қаралды 131 М.
Type Theory for Busy Engineers - Niko Matsakis
51:01
Rust Nederland (RustNL)
Рет қаралды 9 М.
Idris 2: Quantitative Types in Action - Edwin Brady
58:15
Fission
Рет қаралды 4 М.
Type-Driven Development in Idris - Edwin Brady
46:36
Scala World
Рет қаралды 25 М.
"Type-Driven API Design in Rust" by Will Crichton
40:57
Strange Loop Conference
Рет қаралды 124 М.
"Why Programming Languages Matter" by Andrew Black
56:39
Strange Loop Conference
Рет қаралды 27 М.
Dependent Types with David Christiansen - Functional Futures
2:03:05
Eliminating Run-Time Errors with Agda - Computerphile
18:37
Computerphile
Рет қаралды 65 М.
Apple phone #shorts #trending #viralvideo
0:48
Tech Zone
Рет қаралды 676 М.
Как подключить магнитолу?
0:51
KS Customs
Рет қаралды 1,9 МЛН