jasonofthel33t
jasonofthel33t
  • Видео 200
  • Просмотров 2 321 050

Видео

IU Compiler Course Fall 2020 August 25
Просмотров 5243 года назад
IU Compiler Course Fall 2020 August 25
IU Compiler Course Fall 2020 September 3
Просмотров 1663 года назад
IU Compiler Course Fall 2020 September 3
IU Compiler Course Fall 2020 September 1
Просмотров 3633 года назад
IU Compiler Course Fall 2020 September 1
Tomas Petricek: How F# Learned to Stop Worrying and Love the Data
Просмотров 3,5 тыс.9 лет назад
Cross posted from channel 9 Tomas Petricek, a PhD student at University of Cambridge focusing on programming models, teaches us about one of his favorite programming languages, F#. The main topic is programming data with F#. You'll learn about Type Providers and Tomas will show how you can easily call REST APIs from F# using type providers and how you can access WorldBank data, but with a sligh...
Adventure with Types in Haskell - Simon Peyton Jones (Lecture 4)
Просмотров 6 тыс.10 лет назад
Recorded at Oregon Programming Languages Summer School 2013. www.cs.uoregon.edu/research/summerschool/summer13/curriculum.html Lecture 1 Slides: www.cs.uoregon.edu/research/summerschool/summer13/lectures/ClassesJimOPLSS.pdf System F in GHC: www.cs.uoregon.edu/research/summerschool/summer13/lectures/FC_in_GHC_July13.pdf Kinds and GADTs: www.cs.uoregon.edu/research/summerschool/summer13/lectures/...
Adventure with Types in Haskell - Simon Peyton Jones (Lecture 3)
Просмотров 8 тыс.10 лет назад
Recorded at Oregon Programming Languages Summer School 2013. www.cs.uoregon.edu/research/summerschool/summer13/curriculum.html Lecture 1 Slides: www.cs.uoregon.edu/research/summerschool/summer13/lectures/ClassesJimOPLSS.pdf System F in GHC: www.cs.uoregon.edu/research/summerschool/summer13/lectures/FC_in_GHC_July13.pdf Kinds and GADTs: www.cs.uoregon.edu/research/summerschool/summer13/lectures/...
Adventure with Types in Haskell - Simon Peyton Jones (Lecture 2)
Просмотров 20 тыс.10 лет назад
Recorded at Oregon Programming Languages Summer School 2013. www.cs.uoregon.edu/research/summerschool/summer13/curriculum.html Lecture 1 Slides: www.cs.uoregon.edu/research/summerschool/summer13/lectures/ClassesJimOPLSS.pdf System F in GHC: www.cs.uoregon.edu/research/summerschool/summer13/lectures/FC_in_GHC_July13.pdf Kinds and GADTs: www.cs.uoregon.edu/research/summerschool/summer13/lectures/...
Adventure with Types in Haskell - Simon Peyton Jones (Lecture 1)
Просмотров 65 тыс.10 лет назад
Recorded at Oregon Programming Languages Summer School 2013. www.cs.uoregon.edu/research/summerschool/summer13/curriculum.html Lecture 1 Slides: www.cs.uoregon.edu/research/summerschool/summer13/lectures/ClassesJimOPLSS.pdf System F in GHC: www.cs.uoregon.edu/research/summerschool/summer13/lectures/FC_in_GHC_July13.pdf Kinds and GADTs: www.cs.uoregon.edu/research/summerschool/summer13/lectures/...
Brian Beckman: The Zen of Stateless State - The State Monad
Просмотров 48 тыс.10 лет назад
Concurrency is a problem that faces all developers as we move to the age of ManyCore processor architectures. Managing state is an important aspect of programming generally and for parallel programming especially. The great Brian Beckman demonstrates three ways of labeling a binary tree with unique integer node numbers: (1) by hand, (2) non-monadically, but functionally, by threading an updatin...
Expert to Expert: Brian Beckman and Erik Meijer - Inside the .NET Reactive Framework (Rx)
Просмотров 44 тыс.10 лет назад
Cross posted from channel9.msdn.com/Shows/Going Deep/Expert-to-Expert-Brian-Beckman-and-Erik-Meijer-Inside-the-NET-Reactive-Framework-Rx Erik Meijer and team (developer Wes Dyer, in particular) have created a profound and beautiful .NET library that will take managed event based programming to new levels. Of course, many of you wish that you could write LINQ expressions over events. Well, now y...
HerbSutterQuestionsAndAnswers 2MB ch9
Просмотров 1,4 тыс.10 лет назад
Cross posted from channel9.msdn.com/Shows/Going Deep/Herb-Sutter-C-Questions-and-Answers Herb's last appearance on C9 was a relatively short chat with me about C 0x. You wanted more questions asked and some of you thought I was just too soft on Herb. Well, Herb decided that the best way to get the questions you want asked is, well, to have you ask them. Most of the highest user-rated questions ...
Bjarne Stroustrup - The Essence of C++: With Examples in C++84, C++98, C++11, and C++14
Просмотров 1,1 тыс.10 лет назад
I don't own this. This is cross posted from channel9.msdn.com/Events/GoingNative/2013/Opening-Keynote-Bjarne-Stroustrup. C 11 is being deployed and the shape of C 14 is becoming clear. This talk examines the foundations of C . What is essential? What sets C apart from other languages? How do new and old features support (or distract from) design and programming relying on this essence? I focus ...
CROSS 2013: The Church as the Means and the Goal of Missions (Session IX)
Просмотров 98910 лет назад
Cross posted from vimeo.com/82988054. D.A. Carson preaches on the social dimensions of both sin and the gospel. Sin doesn't just send you to Hell, and the gospel doesn't just save your soul. Each has necessary social, personal, and horizontal ramifications, culminating in the existence of and a commitment to the church, the bride of Christ, for it is in the church where the love of God is made ...
CROSS 2013: The Chief End of Missions: The Supremacy of God in the Joy of All Peoples (Session I)
Просмотров 41010 лет назад
I do not own this video, this video is cross posted from vimeo.com/82838891. "The chief end of missions is the supremacy of God in the joy of all peoples." These two ends are of an identical essence, totally and completely inseparable, for the only gladness that lasts is a gladness in the glory of God. This reality frees us from choosing either the glory of God or compassion for the lost as the...
Everything I Ever Learned about JVM Performance Tuning @twitter
Просмотров 6 тыс.10 лет назад
Everything I Ever Learned about JVM Performance Tuning @twitter
C9LecturesMonadicDPWp4_2MB_ch9
Просмотров 42511 лет назад
C9LecturesMonadicDPWp4_2MB_ch9
Rich Hickey - The Database as a Value
Просмотров 9 тыс.11 лет назад
Rich Hickey - The Database as a Value
ELangsClojureFSharpHickeyPamer_2MB_ch9
Просмотров 32511 лет назад
ELangsClojureFSharpHickeyPamer_2MB_ch9
C9 Lectures: Dr. Ralf Lämmel - The Quick Essence of Functional Programming
Просмотров 1,9 тыс.11 лет назад
C9 Lectures: Dr. Ralf Lämmel - The Quick Essence of Functional Programming
C9LecturesGregMeredithMonadicDesignPatternsp3_2MB_ch9
Просмотров 42711 лет назад
C9LecturesGregMeredithMonadicDesignPatternsp3_2MB_ch9
C9LecturesGregMeredithMonadicDesignPatternsp2_2MB_ch9
Просмотров 86611 лет назад
C9LecturesGregMeredithMonadicDesignPatternsp2_2MB_ch9
C9 Lectures: Greg Meredith - Monadic Design Patterns for the Web - Introduction to Monads
Просмотров 7 тыс.11 лет назад
C9 Lectures: Greg Meredith - Monadic Design Patterns for the Web - Introduction to Monads
Running a startup on Haskell
Просмотров 111 тыс.11 лет назад
Running a startup on Haskell
Ready Set Clojure!
Просмотров 4,3 тыс.11 лет назад
Ready Set Clojure!
An Analysis of the Redesign of the CoffeeScript Compiler
Просмотров 96711 лет назад
An Analysis of the Redesign of the CoffeeScript Compiler
Term-Rewriting in JavaScript for Fun and World Domination
Просмотров 1,7 тыс.11 лет назад
Term-Rewriting in JavaScript for Fun and World Domination
Open Systems - Actors and Cloud
Просмотров 61411 лет назад
Open Systems - Actors and Cloud
YOW 2011 Simon Peyton Jones - Closer to Nirvana
Просмотров 12 тыс.11 лет назад
YOW 2011 Simon Peyton Jones - Closer to Nirvana
Expert to Expert: Rich Hickey and Brian Beckman - Inside Clojure
Просмотров 112 тыс.11 лет назад
Expert to Expert: Rich Hickey and Brian Beckman - Inside Clojure

Комментарии

  • @ericgrimard4608
    @ericgrimard4608 День назад

    ok... Really? i just eared your best brain explain without a laugh that a incunable was produced for nothing (you have any idea of the cost in cash, resources and efforts for such a thing, then?)and the proof is given by mathematicians like this who found a pattern reveling no known words.???? yea.... that sure solves a mystery...... sad. loved the book though

  • @ericgrimard4608
    @ericgrimard4608 6 дней назад

    fell in it in 94 and still in

  • @TheDa6781
    @TheDa6781 14 дней назад

    The cameraman is an asshole

  • @germainperez7114
    @germainperez7114 28 дней назад

    I feel a lot better now, knowing that the 4 years it took me to finish I'm A Strange Loop is not out of the ordinary

  • @danwroy
    @danwroy 28 дней назад

    I'm promised a friendly explanation of what a monad is and I get an 18 minute demonstration of composing two redundant functions

  • @durutheguru
    @durutheguru Месяц назад

    i want to be like Latif when I grow up

  • @paulpinecone2464
    @paulpinecone2464 Месяц назад

    Wow! I finally understand monads! It's a way to make something that's simple sound complicated. I am so glad that someone is worrying about my job security. I'm ready to drink the Kool-Aid as soon as you can help me with one thing. What is the incantation to use when someone asks me what they're for?

  • @TankorSmash
    @TankorSmash 2 месяца назад

    The file link is down :(

  • @aliozgurbaltaoglu
    @aliozgurbaltaoglu 2 месяца назад

    Max Planck Institute in Marburg and the Philipps University in Marburg has stumbled upon the first regular molecular fractal in nature. April 2024

  • @BuleriaChk
    @BuleriaChk 2 месяца назад

    Godel's "Theorem" is a complete farce and absolute bullshit. Godel assigns a unique number to all the symbols in real numbers via the Fundamental Theorem of Algebra: e.g., the syntactical symbols "+", "-", "x" (multiplication) as well as the actual numbers and powers (e.g. 3^2). By his criteria, a "proof" consists of a tautology on each side of the equal sign. At first, one might think the statement "3 + 4 = 7" is a "proof", since it can be reduced to a sum of units on either side. But that would be a contradiction, according to Godel, because "3 + 4" has a different Godel Number than "7". So the only "proofs" for Godel are G(wff) = G(wff); any other statement is a contradiction by Godel Number. I call BS - a giant twittering machine built on nothing, see my pdfs on physicsdiscussionforum dot org Remember, you read it here first... :)

  • @durutheguru
    @durutheguru 2 месяца назад

    i want to be like Latif when I grow up 🥺

  • @rutwikmore7462
    @rutwikmore7462 2 месяца назад

    Thank you for easy explaination!!

  • @Russ_Paul
    @Russ_Paul 2 месяца назад

    I love it when things are described as trivial. I spent 5 minutes trying to figure out what (x + y ) % 12 was calculating. Now onto monads, lol.

  • @rutwikmore7462
    @rutwikmore7462 2 месяца назад

    Awesome

  • @rutwikmore7462
    @rutwikmore7462 2 месяца назад

    Thanks

  • @andrelu3561
    @andrelu3561 2 месяца назад

    thx

  • @Sahuagin
    @Sahuagin 2 месяца назад

    so you have generics. monads are just something cool you can do with generics of 1 type parameter. calling them "monads" is actually a bit confusing, because it's really more about the BIND function. there are three steps. (there are some additional technical requirements for these steps to really make you qualify, or else things won't work perfectly, but that's not important to understand the general concepts). (when I say "add a function" below, it means YOU need to DESIGN AND IMPLEMENT these functions. sometimes it will be obvious how to implement them, but you might have to be creative and make decisions about how the meaning of your type should flow when you design these.) step 1: start with a generic type of 1 type parameter. Thing<A>. add to it a Map function. Map converts Thing<A>s into Thing<B>s given a function A -> B. in LINQ this is called Select. for javascript arrays it is called map. doing this makes your Thing a "functor". Map lets you convert Thing<A>s to Thing<B>s converting _only_ the inside part (A and B). The outer enhancement part (whatever Thing does) is unaffected. step 2: add to Thing<A> an Apply function. Apply converts Thing<A>s to Thing<B>s given a Thing<function A -> B>. this is a bit weird but it allows you to merge a Thing<A> with a Thing<function A -> B> and get back a Thing<B> which has its uses. (in practice a Thing<A> does something magical to As; this lets you combine two Things together, one that is wrapping a transformation function. you could apply, for example, an IEnumerable<Func<int, string>> to an IEnumerable<int>.) doing this makes your Thing an "applicative". step 3: add to Thing<A> a Bind function. Bind converts Thing<A>s to Thing<B>s given a function A -> Thing<B>. this allows you to convert Thing<A>s to Thing<B>s while not just modifying the inner part (A and B) but also modifying the outer enhancement part (whatever Thing does). in LINQ this is SelectMany. (notice that Select cannot change the structure of the IEnumerable, it can only modify the internal elements. while SelectMany totally can change the whole structure. you can turn any IEnumerable into an empty IEnumerable with a single SelectMany call; or you can double or triple the number of elements, etc.) adding Bind makes your Thing a "monad". (with some other technical requirements; like you are supposed to be able to create a Thing<A> given an A, but that's kind of obvious.)

  • @freddykruger8229
    @freddykruger8229 2 месяца назад

    I purchased this book 3 years ago. Still haven't read a page😂. I am attempting to now.

  • @amanmotghare7196
    @amanmotghare7196 2 месяца назад

    Extremly good explaination , IIIT Nagpur students must watch

  • @carloscoll5249
    @carloscoll5249 2 месяца назад

    Would infinity be a concept that would be considered true but not provable?

  • @KipIngram
    @KipIngram 2 месяца назад

    I don't fear it - I just have no use for it.

    • @Sahuagin
      @Sahuagin 2 месяца назад

      if you use IEnumerable + LINQ or javascript arrays with map and flatMap, you're already using it

  • @apppples
    @apppples 3 месяца назад

    Is bind a function that takes an Ma to an a? If yes, why not say that, if no... Then I have no idea what a monad is inspite of everything leading up to it in the video being trivial

    • @Sahuagin
      @Sahuagin 2 месяца назад

      bind takes an *Ma* and a function *a -> Mb* and returns an *Mb* . ( *Ma -> (a -> Mb) -> Mb* ). exactly why this is important though still eludes me but I think I'm close to getting it. (in some languages it is called "flatmap" because it "maps" (projects) but also flattens. in LINQ it is SelectMany. Notice that SelectMany projects but also flattens.)

    • @Sahuagin
      @Sahuagin 2 месяца назад

      I basically get it now. Map/Select project the inner value into a new form while maintaining the outer enhancement. Bind/SelectMany project inner values into the monad type but "flatten" them (if you used Map/Select to do this you would get Monads of Monads, which can also be useful). this means that Bind/SelectMany can alter the structure/ehancement part of the monad, which is more powerful than Map/Select (but very often Map/Select is all you need).

  • @RUMPLEforeskin25
    @RUMPLEforeskin25 3 месяца назад

    When you have a high school education in math but still find this absolutely fascinating.. I wish I could go back in time. lol

  • @ShahFaisalKhan987
    @ShahFaisalKhan987 3 месяца назад

    Which book do you refer sir?

  • @linz4213
    @linz4213 3 месяца назад

    20+ times watch this, every time I got some new insight, this time is I'm more curious about the address part of the Actor model, it's the key to make it a really useful like Zenoh's key expression, a global dynamic name space, instead of more static integer based IP like address

  • @ehhhhhhhhhh
    @ehhhhhhhhhh 3 месяца назад

    Wow, why the hell did MIT take this course down?!? I really wanted to know which readings were covered in each lecture. Does anyone know if there's a syllabus that says what the readings are?

  • @aliozgurbaltaoglu
    @aliozgurbaltaoglu 3 месяца назад

    what is the rule for being a tree?

  • @pedzsan
    @pedzsan 4 месяца назад

    I gave up after 50 minutes. I found this presentation horrible. I can’t put it in a nice way. Five minutes at the Wikipedia page for Monads tells me far more than this presentation did in 50 minutes and he isn’t finished talking.

    • @Sahuagin
      @Sahuagin 2 месяца назад

      sorry I take that back. I more or less get Monads now and this is not a great explanation after all.

  • @zenicv
    @zenicv 4 месяца назад

    it is not true that Zeon's paradox is resolved. It is a common fallacy, esp. to assume that Calculus solved it. Zeno was not that silly. He was referring to monism (how things can't be divided) and inherent complexities when you discretize a continuous concept like time or space. I've written a paper on it, refuting the claims of an MIT philosopher. Also, some books on philosophy of metaphysics throws more light into it.

  • @Failure-lv3lo
    @Failure-lv3lo 4 месяца назад

    Hi. Are you alive? 12 years old video and no likes/dislike and only 200 views on this video?

  • @tdc953
    @tdc953 4 месяца назад

    At about 54:30, someone asks if we could write a computer program to tell if a program behaves like a recursive program and the lecturer doesn't seem to know for sure. That problem is undecidable, i.e., there is no computer program that can tell if a program behaves like a recursive program. Could be a nice assignment problem for a theory of computation course (I'm assuming there is a computable function that we consider to not be recursive).

  • @declup
    @declup 4 месяца назад

    SPJ, what a mensch.

  • @rumfordc
    @rumfordc 4 месяца назад

    > Dont fear the monad > more than 1 hour long > *mission failed*

  • @sysarcher
    @sysarcher 4 месяца назад

    WOW... I'm seeing this too late into my career! I've tried to explain this stuff without success. THIS IS THE VIDEO TO REFER TO!!

  • @TheVincent0268
    @TheVincent0268 4 месяца назад

    ik snap er nog steeds geen reet van

  • @mmxgn
    @mmxgn 4 месяца назад

    Came to this video after a recommendation seeing if I can finally understand monads but alas I failed again. The video has the same shortcomings as lots of other "explaining monads simply" videos on the internet, that is: 1. Start with explaining intuitive and almost obvious concepts, making you think you finally got it. 2. Introducing the bind operator without actually saying what its purpose is, only much later that its somehow related to function composition. 3. Saying, "so you see, it is actually simple" without actually saying WHAT is a monad in all of this writing. Is it the bind operator? Is it a function? Repeating things such as: "See, it's not magic" lots of times doesn't make it more easy to understand. It doesn't help that at the most critical moment the person recording decided to keep the writing of Dr Beckman completely out of the picture. I actually understood much more on a video from "Studying with Alex" which shows step by step BY REGARDING NOTHING AS OBVIOUS how to implement a monad. Of course this was practical knowledge, but as a programmer interested in the monad pattern, that's what I needed. I do not give fault to Dr Beckam, the most difficult things to teach are the obvious ones.

  • @phol5082
    @phol5082 4 месяца назад

    18:00

  • @obiwanpez
    @obiwanpez 4 месяца назад

    In most modern Precalc classes, students are taught, using a vector method, that squaring a complex number will double its angular component and square its magnitude. Makes it way easier to eyeball z^2.

  • @bladddeesa
    @bladddeesa 5 месяцев назад

    Solved the MU puzzle in <10 minutes and feeling pretty proud of myself :)

    • @spencert94
      @spencert94 8 дней назад

      It's not possible. To get Mu you need to get Miii or any sequence where M is followed by 6x + 3 i's. This means you need the number of i's to be divisible by 3. You only have two operations that change the number of i's and neither will make a number that isn't divisible by three already divisible by 3. Mx -> Mxx is equivalent to multiplying by 2, Miii -> Mu is equivalent to subtracting 3.

  • @RobertCleggRC
    @RobertCleggRC 5 месяцев назад

    Xeno, uh, just aim for 2x the distance to the laptop. Travel half the distance. Boom. No calculus. Im the first to have ever answered this without calculus and i didnt go to MIT. I would like my name to go down in the history of philosophy. A full scholarship wouldn't be bad either.

  • @obiwanpez
    @obiwanpez 5 месяцев назад

    Him: “I’ll give $20 to the first person to prove MU from only these rules.” Me: “I wonder if this is a Millennial Problem…”

  • @obiwanpez
    @obiwanpez 5 месяцев назад

    “When I taught this course two Springs ago…” as a Sophomore. I didn’t get up in front of a class and formally teach a subject until my Senior year, and that was about once every 2-3 class days, since all of us MathEd-majors had to take turns.

  • @mikebocchinfuso9437
    @mikebocchinfuso9437 6 месяцев назад

    I have been at it (on and off) for 30 years now and still have not got through it!

  • @willw2596
    @willw2596 6 месяцев назад

    This is the best explanation of every aspect of the type checking notions, which most videos just gloss over. Thank you so much.

  • @doilyhead
    @doilyhead 7 месяцев назад

    Read the book independently while taking "Computability and Formal Languages" at Barnard/Columbia back in the 80s.

  • @Autom_te
    @Autom_te 7 месяцев назад

    For anyone confused he's refering to Erik Meijer and LINQ

  • @Max11551
    @Max11551 7 месяцев назад

    Next level MIT OCW. <3

  • @v.baranov450
    @v.baranov450 7 месяцев назад

    Can someone explain 37:25? Does the actor use it's own balance when passing balance + deposit to another actor, or it'll be bould to the receiving actor's balance? Also it seems to me that the actor holds immutable data (balance in this case), but is it required for the actor model to work?

  • @fabricehategekimana5350
    @fabricehategekimana5350 7 месяцев назад

    Thanks for this informative video !

  • @archer-1203
    @archer-1203 7 месяцев назад

    Is there a version for dummies?