本站已收录 番号和无损神作磁力链接/BT种子 

Coursera - Programming Languages; University of Washington

种子简介

种子名称: Coursera - Programming Languages; University of Washington
文件类型:
文件数目: 171个文件
文件大小: 2.06 GB
收录时间: 2016-1-15 20:35
已经下载: 3
资源热度: 180
最近下载: 2024-12-23 15:55

下载BT种子文件

下载Torrent文件(.torrent) 立即下载

磁力链接下载

magnet:?xt=urn:btih:A3374F34FCF9A628FC0F5C23596604E2BD37266C&dn=Coursera - Programming Languages; University of Washington 复制链接到迅雷、QQ旋风进行下载,或者使用百度云离线下载。

喜欢这个种子的人也喜欢

种子包含的文件

Coursera - Programming Languages; University of Washington.torrent
  • 09-19 - Optional Dynamic Dispatch Manually in Racket (1556).mp426.11MB
  • 10-05 - Double Dispatch (1446).mp422.9MB
  • 08-05 - What Your Interpreter Can and Cannot Assume (1347).mp422.05MB
  • 03-12 - Each of Pattern Matching _ Truth About Functions (1430).mp420.35MB
  • 02-04 - ML Variable Bindings and Expressions (1432).mp420.08MB
  • 10-02 - OOP Versus Functional Decomposition (1251).mp419.35MB
  • 08-15 - Static Versus Dynamic Typing Part Two (1347).mp419.22MB
  • 09-04 - Object State (1314).mp418.9MB
  • 02-06 - The REPL and Errors (1210).mp418.51MB
  • 07-09 - Local Bindings (1311).mp418.5MB
  • 04-23 - Optional Java Without Closures (1208).mp418.06MB
  • 09-03 - Classes and Objects (1237).mp417.89MB
  • 10-08 - Mixins (1152).mp417.82MB
  • 09-06 - A Longer Example (1219).mp417.79MB
  • 06-05 - Optional Why ML Racket and Ruby (1234).mp417.66MB
  • 10-15 - Function Subtyping (1117).mp417.45MB
  • 10-03 - Adding Operations or Variants (1108).mp417.32MB
  • 09-17 - Method-Lookup Rules Precisely (1131).mp416.95MB
  • 02-02 - Course Introduction About the Course (1234).mp416.89MB
  • 05-12 - Signatures for Our Example (1103).mp416.7MB
  • 04-11 - Why Lexical Scope (1144).mp416.7MB
  • 04-13 - Fold and More Closures (1128).mp416.64MB
  • 04-21 - Optional Abstract Data Types With Closures (1114).mp416.63MB
  • 04-24 - Optional C Without Closures (1056).mp416.55MB
  • 09-16 - Overriding and Dynamic Dispatch (1056).mp416.51MB
  • 09-10 - Blocks (1134).mp416.41MB
  • 03-06 - Useful Datatypes (1122).mp416.16MB
  • 05-11 - A Module Example (1106).mp416.13MB
  • 02-03 - Course Introduction About Programming Languages (1204).mp416.08MB
  • 09-09 - Arrays (1113).mp415.93MB
  • 07-06 - Parentheses Matter (Debugging Practice) (1050).mp415.82MB
  • 03-05 - Case Expressions (1050).mp415.79MB
  • 07-14 - Delayed Evaluation and Thunks (1012).mp415.75MB
  • 02-12 - List Functions (1121).mp415.67MB
  • 10-07 - Multiple Inheritance (1018).mp415.65MB
  • 07-18 - Defining Streams (1049).mp415.63MB
  • 10-11 - Subtyping From the Beginning (1043).mp415.5MB
  • 07-23 - Optional Variables Macros and Hygiene (1052).mp415.45MB
  • 07-19 - Memoization (1017).mp415.33MB
  • 07-17 - Using Streams (1010).mp415.27MB
  • 06-04 - Optional Why Functional Languages (1115).mp415.21MB
  • 02-11 - Introducing Lists (1034).mp415.14MB
  • 08-11 - What is Static Checking (1000).mp415.1MB
  • 04-16 - Partial Application (941).mp414.96MB
  • 05-06 - Polymorphic Examples (1052).mp414.87MB
  • 02-14 - Let and Efficiency (1010).mp414.81MB
  • 04-15 - Closure Idiom Currying (1032).mp414.8MB
  • 09-14 - Subclassing (1011).mp414.78MB
  • 06-02 - Optional Why Study General PL Concepts (1030).mp414.58MB
  • 09-18 - Dynamic Dispatch Versus Closures (938).mp414.54MB
  • 08-03 - Datatype-Programming in Racket With Structs (934).mp414.5MB
  • 03-15 - More Nested Patterns (1043).mp414.42MB
  • 08-12 - Soundness and Completeness (946).mp414.39MB
  • 08-04 - Implementing Programming Languages (1007).mp414.33MB
  • 05-07 - Optional The Value Restriction and Other Type-Inference Challenges (953).mp414.28MB
  • 05-05 - Type Inference Examples (1027).mp414.22MB
  • 11-01 - Optional Course Content Wrapup (943).mp414.21MB
  • 05-18 - Standard Equivalences (1001).mp414.21MB
  • 05-08 - Mutual Recursion (945).mp414.18MB
  • 07-22 - Optional Racket Macros With define-syntax (925).mp414.14MB
  • 07-07 - Dynamic Typing (936).mp414.07MB
  • 09-02 - Introduction to Ruby (1008).mp414.07MB
  • 05-15 - Another Equivalent Structure (901).mp413.99MB
  • 08-14 - Static Versus Dynamic Typing Part One (940).mp413.98MB
  • 08-09 - Racket Functions As Macros For Interpreted Language (915).mp413.96MB
  • 10-14 - Optional Java_C Arrays (911).mp413.91MB
  • 07-03 - Racket Definitions Functions Conditionals (1014).mp413.88MB
  • 08-13 - Weak Typing (939).mp413.74MB
  • 07-16 - Delay and Force (918).mp413.6MB
  • 07-24 - Optional More Macros Examples (912).mp413.6MB
  • 03-19 - Tail Recursion (944).mp413.58MB
  • 11-02 - Optional MOOC Wrapup (939).mp413.22MB
  • 04-14 - Closure Idiom Combining Functions (918).mp413.19MB
  • 09-13 - Hashes and Ranges (859).mp413.08MB
  • 04-05 - Anonymous Functions (917).mp413.07MB
  • 08-08 - Optional Are Closures Efficient (903).mp413.07MB
  • 02-15 - Options (909).mp413.06MB
  • 08-10 - ML Versus Racket (853).mp413MB
  • 10-13 - Depth Subtyping (850).mp412.95MB
  • 04-03 - Functions as Arguments (840).mp412.89MB
  • 10-10 - Optional Abstract Methods (851).mp412.83MB
  • 04-08 - Generalizing Prior Topics (901).mp412.83MB
  • 02-09 - Functions Formally (856).mp412.81MB
  • 07-08 - Cond (852).mp412.63MB
  • 02-10 - Pairs and Other Tuples (916).mp412.6MB
  • 03-04 - Datatype Bindings (839).mp412.6MB
  • 03-10 - Lists and Options are Datatypes (910).mp412.6MB
  • 07-04 - Racket Lists (907).mp412.55MB
  • 10-12 - The Subtype Relation (820).mp412.46MB
  • 10-16 - Generics Versus Subtyping (816).mp412.36MB
  • 02-05 - Rules for Expressions (913).mp412.33MB
  • 07-20 - Macros The Key Points (852).mp412.32MB
  • 05-17 - Equivalent Functions (841).mp412.3MB
  • 09-05 - Visibility (839).mp412.24MB
  • 07-02 - Introduction to Racket (823).mp412.2MB
  • 07-05 - Syntax and Parentheses (836).mp412.19MB
  • 04-19 - Closure Idiom Callbacks (825).mp412.18MB
  • 04-07 - Map and Filter (856).mp412.04MB
  • 07-11 - Mutation with set (828).mp412.03MB
  • 03-11 - Polymorphic Datatypes (811).mp411.99MB
  • 03-08 - Another Expression Example (801).mp411.92MB
  • 10-17 - Bounded Polymorphism (805).mp411.92MB
  • 08-16 - Optional eval and quote (758).mp411.85MB
  • 03-02 - Records (825).mp411.72MB
  • 04-04 - Polymorphic Types and Functions as Arguments (757).mp411.51MB
  • 10-04 - Binary Methods with Functional Decomposition (718).mp411.51MB
  • 04-18 - Mutable References (807).mp411.49MB
  • 09-07 - Class Definitions are Dynamic (742).mp411.48MB
  • 03-14 - Polymorphic and Equality Types (800).mp411.41MB
  • 07-12 - The Truth About Cons (746).mp411.32MB
  • 03-18 - Exceptions (747).mp411.29MB
  • 04-02 - Introduction to First-Class Functions (750).mp411.11MB
  • 04-20 - Standard-Library Documentation (700).mp410.99MB
  • 10-09 - Interfaces (733).mp410.95MB
  • 09-08 - Duck Typing (728).mp410.93MB
  • 02-17 - Benefits of No Mutation (724).mp410.85MB
  • 07-13 - mcons For Mutable Pairs (738).mp410.66MB
  • 02-13 - Let Expressions (751).mp410.64MB
  • 04-10 - Lexical Scope and Higher-Order Functions (737).mp410.63MB
  • 03-20 - Accumulators for Tail Recursion (739).mp410.57MB
  • 04-09 - Lexical Scope (722).mp410.55MB
  • 09-15 - Why Use Subclassing (716).mp410.48MB
  • 07-21 - Optional Tokenization Parenthesization and Scope (730).mp410.45MB
  • 02-08 - Functions Informally (737).mp410.36MB
  • 05-10 - Signatures and Hiding Things (702).mp410.25MB
  • 07-15 - Avoiding Unnecessary Computations (648).mp410.24MB
  • 09-12 - Procs (708).mp410.18MB
  • 02-16 - Booleans and Comparison Operations (700).mp410.01MB
  • 05-14 - An Equivalent Structure (638).mp49.93MB
  • 04-17 - Currying Wrapup (640).mp49.88MB
  • 04-12 - Closures and Recomputation (630).mp49.85MB
  • 03-13 - A Little Type Inference (628).mp49.79MB
  • 03-16 - Nested Patterns Precisely (635).mp49.59MB
  • 06-03 - Optional Are All PLs the Same (651).mp49.59MB
  • 08-07 - Implementing Closures (632).mp49.55MB
  • 10-06 - Optional Multimethods (636).mp49.45MB
  • 03-09 - Type Synonyms (619).mp49.39MB
  • 05-09 - Modules for Namespace Management (625).mp49.36MB
  • 02-07 - Shadowing (649).mp49.15MB
  • 08-06 - Implementing Variables and Environments (629).mp49.13MB
  • 09-11 - Using Blocks (624).mp49.12MB
  • 05-19 - Equivalence Versus Performance (600)-1.mp48.81MB
  • 02-19 - Pieces of a Language (602).mp48.79MB
  • 03-03 - Tuples as Syntactic Sugar (606).mp48.72MB
  • 05-04 - ML Type Inference (609).mp48.72MB
  • 06-01 - Optional Course-Motivation Introduction (556).mp48.17MB
  • 05-03 - What is Type Inference (537).mp47.93MB
  • 03-01 - Building Compound Types (534).mp47.88MB
  • 11-03 - Optional Meet the TAs (200).mp47.83MB
  • 03-21 - Perspective on Tail Recursion (533).mp47.78MB
  • 02-18 - Optional Java Mutation (444).mp47.2MB
  • 04-06 - Unnecessary Function Wrapping (505).mp47.02MB
  • 07-10 - Toplevel Bindings (454).mp46.96MB
  • 04-22 - Optional Closure Idioms Without Closures (448).mp46.92MB
  • 01-04 - SML Mode installation (352).mp46.45MB
  • 03-07 - Pattern Matching So Far (437).mp46.28MB
  • 05-13 - Signature Matching (403).mp46.08MB
  • 05-16 - Different Modules Define Different Types (332).mp45.56MB
  • 03-17 - Optional Function Patterns (340).mp45.42MB
  • 01-02 - Emacs installation (227).mp44.88MB
  • 01-03 - SML installation (147).mp43.37MB
  • 08-02 - Section Introduction (208).mp43.03MB
  • 05-02 - Section Introduction (145).mp42.33MB
  • 01-01 - Installation Introduction (122).mp41.99MB
  • 05-01 - Section 4 Reading Notes.mp4704.85KB
  • 10-01 - Section 8 Reading Notes.mp4704.85KB
  • 07-01 - Section 5 Reading Notes.mp4704.85KB
  • 04-01 - Section 3 Reading Notes.mp4704.85KB
  • 09-01 - Section 7 Reading Notes.mp4704.85KB
  • 08-01 - Section 6 Reading Notes.mp4704.85KB
  • 02-01 - Section 1 Reading Notes.mp4704.85KB