From scm at iis.sinica.edu.tw Fri Sep 6 12:07:59 2013 From: scm at iis.sinica.edu.tw (Shin-Cheng Mu) Date: Fri, 6 Sep 2013 12:07:59 +0800 Subject: [Fun-thursday] Slides: A Brief Intro. to Dependently Typed Programming Message-ID: Dear friends, These are my slides yesterday, "A Brief Intro. to Dependently Typed Programming" http://pc-scm.iis.sinica.edu.tw/FT20130905.pdf sincerely, Shin scm at iis.sinica.edu.tw From suhorng at gmail.com Fri Sep 6 22:07:46 2013 From: suhorng at gmail.com (suhorng Y) Date: Fri, 6 Sep 2013 22:07:46 +0800 Subject: [Fun-thursday] #5: Write Yourself a Toy \lambda-Calculus Virtual Machine Message-ID: Hi all, Here is the slide: ``Write Yourself a Toy ?-Calculus Virtual Machine" http://suhorng.github.io/llintr/lvm.html (lvm, not llvm XD) Hope you enjoy it! Best regards, suhorng -------------- next part -------------- An HTML attachment was scrubbed... URL: From suhorng at gmail.com Sat Sep 7 00:04:20 2013 From: suhorng at gmail.com (suhorng Y) Date: Sat, 7 Sep 2013 00:04:20 +0800 Subject: [Fun-thursday] Slides: A Brief Intro. to Dependently Typed Programming In-Reply-To: References: Message-ID: Hello: Just wanna make sure. In the sorting example, we gave it the type sort : (xs : [N]) -> \exists ( \ys -> Perm xs ys * Ordered ys ) Similarly, in the maximum function, we have the type max : (xs : [N]) -> (xs /= []) -> \exists ( Sup xs ) and `Sup xs` is also a function. Why wouldn't we give the proof directly, but rather uses assertions that when given a parameter, tries to (re-?)construct the proof? suhorng 2013/9/6 Shin-Cheng Mu > Dear friends, > > These are my slides yesterday, > "A Brief Intro. to Dependently Typed Programming" > > http://pc-scm.iis.sinica.edu.tw/FT20130905.pdf > > sincerely, > Shin > scm at iis.sinica.edu.tw > > > > _______________________________________________ > Fun-thursday mailing list > Fun-thursday at iis.sinica.edu.tw > http://www.iis.sinica.edu.tw/mailman/listinfo/fun-thursday > -------------- next part -------------- An HTML attachment was scrubbed... URL: