"A Little Taste of Dependent Types" by David Christiansen

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

Strange Loop Conference

Strange Loop Conference

Күн бұрын

Пікірлер: 22
@NoNameAtAll2
@NoNameAtAll2 2 жыл бұрын
"Why recursion is not an option?" "Because recursion is not an option!" xD
@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)
@andrewsinclair7654
@andrewsinclair7654 6 жыл бұрын
This was my favorite talk from Strangeloop 2018! Thanks David for the amazing presentation, slides, and a book too!
@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.
@desjajjaden49
@desjajjaden49 11 ай бұрын
Watched this for literally 5 times, mind-blowing and really nice job!
@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....
@anilraghu8687
@anilraghu8687 4 жыл бұрын
Per Martin Lof Intuitionistic type theory.
@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
@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?
Type Theory for the Working Rustacean - Dan Pittman
19:24
Rust Belt Rust Conference
Рет қаралды 18 М.
Beat Ronaldo, Win $1,000,000
22:45
MrBeast
Рет қаралды 155 МЛН
How many people are in the changing room? #devil #lilith #funny #shorts
00:39
"Idris: Practical Dependent Types with Practical Examples" by Brian McKenna
40:56
Strange Loop Conference
Рет қаралды 28 М.
Type-Driven Development in Idris - Edwin Brady
46:36
Scala World
Рет қаралды 25 М.
Propositions as Types - Computerphile
17:46
Computerphile
Рет қаралды 99 М.
"Propositions as Types" by Philip Wadler
42:43
Strange Loop Conference
Рет қаралды 130 М.
"Dependent Types in Haskell" by Stephanie Weirich
38:42
Strange Loop Conference
Рет қаралды 23 М.
"Concatenative programming and stack-based languages" by Douglas Creager
40:30
Strange Loop Conference
Рет қаралды 15 М.
Computer Science ∩ Mathematics (Type Theory) - Computerphile
15:56
Computerphile
Рет қаралды 265 М.
Category Theory in Life - Eugenia Cheng
40:39
Lambda World
Рет қаралды 102 М.
Beat Ronaldo, Win $1,000,000
22:45
MrBeast
Рет қаралды 155 МЛН