|
Обратите внимание, что наш сайт не размещает какие-либо файлы из списка. Вы не можете скачать
эти файлы или скачать torrent-файл.
|
| 01-01 - Installation Introduction (122).mp4 |
1.99Мб |
| 01-02 - Emacs installation (227).mp4 |
4.88Мб |
| 01-03 - SML installation (147).mp4 |
3.37Мб |
| 01-04 - SML Mode installation (352).mp4 |
6.45Мб |
| 02-01 - Section 1 Reading Notes.mp4 |
704.85Кб |
| 02-02 - Course Introduction About the Course (1234).mp4 |
16.89Мб |
| 02-03 - Course Introduction About Programming Languages (1204).mp4 |
16.08Мб |
| 02-04 - ML Variable Bindings and Expressions (1432).mp4 |
20.08Мб |
| 02-05 - Rules for Expressions (913).mp4 |
12.33Мб |
| 02-06 - The REPL and Errors (1210).mp4 |
18.51Мб |
| 02-07 - Shadowing (649).mp4 |
9.15Мб |
| 02-08 - Functions Informally (737).mp4 |
10.36Мб |
| 02-09 - Functions Formally (856).mp4 |
12.81Мб |
| 02-10 - Pairs and Other Tuples (916).mp4 |
12.60Мб |
| 02-11 - Introducing Lists (1034).mp4 |
15.14Мб |
| 02-12 - List Functions (1121).mp4 |
15.67Мб |
| 02-13 - Let Expressions (751).mp4 |
10.64Мб |
| 02-14 - Let and Efficiency (1010).mp4 |
14.81Мб |
| 02-15 - Options (909).mp4 |
13.06Мб |
| 02-16 - Booleans and Comparison Operations (700).mp4 |
10.01Мб |
| 02-17 - Benefits of No Mutation (724).mp4 |
10.85Мб |
| 02-18 - Optional Java Mutation (444).mp4 |
7.20Мб |
| 02-19 - Pieces of a Language (602).mp4 |
8.79Мб |
| 03-01 - Building Compound Types (534).mp4 |
7.88Мб |
| 03-02 - Records (825).mp4 |
11.72Мб |
| 03-03 - Tuples as Syntactic Sugar (606).mp4 |
8.72Мб |
| 03-04 - Datatype Bindings (839).mp4 |
12.60Мб |
| 03-05 - Case Expressions (1050).mp4 |
15.79Мб |
| 03-06 - Useful Datatypes (1122).mp4 |
16.16Мб |
| 03-07 - Pattern Matching So Far (437).mp4 |
6.28Мб |
| 03-08 - Another Expression Example (801).mp4 |
11.92Мб |
| 03-09 - Type Synonyms (619).mp4 |
9.39Мб |
| 03-10 - Lists and Options are Datatypes (910).mp4 |
12.60Мб |
| 03-11 - Polymorphic Datatypes (811).mp4 |
11.99Мб |
| 03-12 - Each of Pattern Matching _ Truth About Functions (1430).mp4 |
20.35Мб |
| 03-13 - A Little Type Inference (628).mp4 |
9.79Мб |
| 03-14 - Polymorphic and Equality Types (800).mp4 |
11.41Мб |
| 03-15 - More Nested Patterns (1043).mp4 |
14.42Мб |
| 03-16 - Nested Patterns Precisely (635).mp4 |
9.59Мб |
| 03-17 - Optional Function Patterns (340).mp4 |
5.42Мб |
| 03-18 - Exceptions (747).mp4 |
11.29Мб |
| 03-19 - Tail Recursion (944).mp4 |
13.58Мб |
| 03-20 - Accumulators for Tail Recursion (739).mp4 |
10.57Мб |
| 03-21 - Perspective on Tail Recursion (533).mp4 |
7.78Мб |
| 04-01 - Section 3 Reading Notes.mp4 |
704.85Кб |
| 04-02 - Introduction to First-Class Functions (750).mp4 |
11.11Мб |
| 04-03 - Functions as Arguments (840).mp4 |
12.89Мб |
| 04-04 - Polymorphic Types and Functions as Arguments (757).mp4 |
11.51Мб |
| 04-05 - Anonymous Functions (917).mp4 |
13.07Мб |
| 04-06 - Unnecessary Function Wrapping (505).mp4 |
7.02Мб |
| 04-07 - Map and Filter (856).mp4 |
12.04Мб |
| 04-08 - Generalizing Prior Topics (901).mp4 |
12.83Мб |
| 04-09 - Lexical Scope (722).mp4 |
10.55Мб |
| 04-10 - Lexical Scope and Higher-Order Functions (737).mp4 |
10.63Мб |
| 04-11 - Why Lexical Scope (1144).mp4 |
16.70Мб |
| 04-12 - Closures and Recomputation (630).mp4 |
9.85Мб |
| 04-13 - Fold and More Closures (1128).mp4 |
16.64Мб |
| 04-14 - Closure Idiom Combining Functions (918).mp4 |
13.19Мб |
| 04-15 - Closure Idiom Currying (1032).mp4 |
14.80Мб |
| 04-16 - Partial Application (941).mp4 |
14.96Мб |
| 04-17 - Currying Wrapup (640).mp4 |
9.88Мб |
| 04-18 - Mutable References (807).mp4 |
11.49Мб |
| 04-19 - Closure Idiom Callbacks (825).mp4 |
12.18Мб |
| 04-20 - Standard-Library Documentation (700).mp4 |
10.99Мб |
| 04-21 - Optional Abstract Data Types With Closures (1114).mp4 |
16.63Мб |
| 04-22 - Optional Closure Idioms Without Closures (448).mp4 |
6.92Мб |
| 04-23 - Optional Java Without Closures (1208).mp4 |
18.06Мб |
| 04-24 - Optional C Without Closures (1056).mp4 |
16.55Мб |
| 05-01 - Section 4 Reading Notes.mp4 |
704.85Кб |
| 05-02 - Section Introduction (145).mp4 |
2.33Мб |
| 05-03 - What is Type Inference (537).mp4 |
7.93Мб |
| 05-04 - ML Type Inference (609).mp4 |
8.72Мб |
| 05-05 - Type Inference Examples (1027).mp4 |
14.22Мб |
| 05-06 - Polymorphic Examples (1052).mp4 |
14.87Мб |
| 05-07 - Optional The Value Restriction and Other Type-Inference Challenges (953).mp4 |
14.28Мб |
| 05-08 - Mutual Recursion (945).mp4 |
14.18Мб |
| 05-09 - Modules for Namespace Management (625).mp4 |
9.36Мб |
| 05-10 - Signatures and Hiding Things (702).mp4 |
10.25Мб |
| 05-11 - A Module Example (1106).mp4 |
16.13Мб |
| 05-12 - Signatures for Our Example (1103).mp4 |
16.70Мб |
| 05-13 - Signature Matching (403).mp4 |
6.08Мб |
| 05-14 - An Equivalent Structure (638).mp4 |
9.93Мб |
| 05-15 - Another Equivalent Structure (901).mp4 |
13.99Мб |
| 05-16 - Different Modules Define Different Types (332).mp4 |
5.56Мб |
| 05-17 - Equivalent Functions (841).mp4 |
12.30Мб |
| 05-18 - Standard Equivalences (1001).mp4 |
14.21Мб |
| 05-19 - Equivalence Versus Performance (600)-1.mp4 |
8.81Мб |
| 06-01 - Optional Course-Motivation Introduction (556).mp4 |
8.17Мб |
| 06-02 - Optional Why Study General PL Concepts (1030).mp4 |
14.58Мб |
| 06-03 - Optional Are All PLs the Same (651).mp4 |
9.59Мб |
| 06-04 - Optional Why Functional Languages (1115).mp4 |
15.21Мб |
| 06-05 - Optional Why ML Racket and Ruby (1234).mp4 |
17.66Мб |
| 07-01 - Section 5 Reading Notes.mp4 |
704.85Кб |
| 07-02 - Introduction to Racket (823).mp4 |
12.20Мб |
| 07-03 - Racket Definitions Functions Conditionals (1014).mp4 |
13.88Мб |
| 07-04 - Racket Lists (907).mp4 |
12.55Мб |
| 07-05 - Syntax and Parentheses (836).mp4 |
12.19Мб |
| 07-06 - Parentheses Matter (Debugging Practice) (1050).mp4 |
15.82Мб |
| 07-07 - Dynamic Typing (936).mp4 |
14.07Мб |
| 07-08 - Cond (852).mp4 |
12.63Мб |
| 07-09 - Local Bindings (1311).mp4 |
18.50Мб |
| 07-10 - Toplevel Bindings (454).mp4 |
6.96Мб |
| 07-11 - Mutation with set (828).mp4 |
12.03Мб |
| 07-12 - The Truth About Cons (746).mp4 |
11.32Мб |
| 07-13 - mcons For Mutable Pairs (738).mp4 |
10.66Мб |
| 07-14 - Delayed Evaluation and Thunks (1012).mp4 |
15.75Мб |
| 07-15 - Avoiding Unnecessary Computations (648).mp4 |
10.24Мб |
| 07-16 - Delay and Force (918).mp4 |
13.60Мб |
| 07-17 - Using Streams (1010).mp4 |
15.27Мб |
| 07-18 - Defining Streams (1049).mp4 |
15.63Мб |
| 07-19 - Memoization (1017).mp4 |
15.33Мб |
| 07-20 - Macros The Key Points (852).mp4 |
12.32Мб |
| 07-21 - Optional Tokenization Parenthesization and Scope (730).mp4 |
10.45Мб |
| 07-22 - Optional Racket Macros With define-syntax (925).mp4 |
14.14Мб |
| 07-23 - Optional Variables Macros and Hygiene (1052).mp4 |
15.45Мб |
| 07-24 - Optional More Macros Examples (912).mp4 |
13.60Мб |
| 08-01 - Section 6 Reading Notes.mp4 |
704.85Кб |
| 08-02 - Section Introduction (208).mp4 |
3.03Мб |
| 08-03 - Datatype-Programming in Racket With Structs (934).mp4 |
14.50Мб |
| 08-04 - Implementing Programming Languages (1007).mp4 |
14.33Мб |
| 08-05 - What Your Interpreter Can and Cannot Assume (1347).mp4 |
22.05Мб |
| 08-06 - Implementing Variables and Environments (629).mp4 |
9.13Мб |
| 08-07 - Implementing Closures (632).mp4 |
9.55Мб |
| 08-08 - Optional Are Closures Efficient (903).mp4 |
13.07Мб |
| 08-09 - Racket Functions As Macros For Interpreted Language (915).mp4 |
13.96Мб |
| 08-10 - ML Versus Racket (853).mp4 |
13.00Мб |
| 08-11 - What is Static Checking (1000).mp4 |
15.10Мб |
| 08-12 - Soundness and Completeness (946).mp4 |
14.39Мб |
| 08-13 - Weak Typing (939).mp4 |
13.74Мб |
| 08-14 - Static Versus Dynamic Typing Part One (940).mp4 |
13.98Мб |
| 08-15 - Static Versus Dynamic Typing Part Two (1347).mp4 |
19.22Мб |
| 08-16 - Optional eval and quote (758).mp4 |
11.85Мб |
| 09-01 - Section 7 Reading Notes.mp4 |
704.85Кб |
| 09-02 - Introduction to Ruby (1008).mp4 |
14.07Мб |
| 09-03 - Classes and Objects (1237).mp4 |
17.89Мб |
| 09-04 - Object State (1314).mp4 |
18.90Мб |
| 09-05 - Visibility (839).mp4 |
12.24Мб |
| 09-06 - A Longer Example (1219).mp4 |
17.79Мб |
| 09-07 - Class Definitions are Dynamic (742).mp4 |
11.48Мб |
| 09-08 - Duck Typing (728).mp4 |
10.93Мб |
| 09-09 - Arrays (1113).mp4 |
15.93Мб |
| 09-10 - Blocks (1134).mp4 |
16.41Мб |
| 09-11 - Using Blocks (624).mp4 |
9.12Мб |
| 09-12 - Procs (708).mp4 |
10.18Мб |
| 09-13 - Hashes and Ranges (859).mp4 |
13.08Мб |
| 09-14 - Subclassing (1011).mp4 |
14.78Мб |
| 09-15 - Why Use Subclassing (716).mp4 |
10.48Мб |
| 09-16 - Overriding and Dynamic Dispatch (1056).mp4 |
16.51Мб |
| 09-17 - Method-Lookup Rules Precisely (1131).mp4 |
16.95Мб |
| 09-18 - Dynamic Dispatch Versus Closures (938).mp4 |
14.54Мб |
| 09-19 - Optional Dynamic Dispatch Manually in Racket (1556).mp4 |
26.11Мб |
| 10-01 - Section 8 Reading Notes.mp4 |
704.85Кб |
| 10-02 - OOP Versus Functional Decomposition (1251).mp4 |
19.35Мб |
| 10-03 - Adding Operations or Variants (1108).mp4 |
17.32Мб |
| 10-04 - Binary Methods with Functional Decomposition (718).mp4 |
11.51Мб |
| 10-05 - Double Dispatch (1446).mp4 |
22.90Мб |
| 10-06 - Optional Multimethods (636).mp4 |
9.45Мб |
| 10-07 - Multiple Inheritance (1018).mp4 |
15.65Мб |
| 10-08 - Mixins (1152).mp4 |
17.82Мб |
| 10-09 - Interfaces (733).mp4 |
10.95Мб |
| 10-10 - Optional Abstract Methods (851).mp4 |
12.83Мб |
| 10-11 - Subtyping From the Beginning (1043).mp4 |
15.50Мб |
| 10-12 - The Subtype Relation (820).mp4 |
12.46Мб |
| 10-13 - Depth Subtyping (850).mp4 |
12.95Мб |
| 10-14 - Optional Java_C Arrays (911).mp4 |
13.91Мб |
| 10-15 - Function Subtyping (1117).mp4 |
17.45Мб |
| 10-16 - Generics Versus Subtyping (816).mp4 |
12.36Мб |
| 10-17 - Bounded Polymorphism (805).mp4 |
11.92Мб |
| 11-01 - Optional Course Content Wrapup (943).mp4 |
14.21Мб |
| 11-02 - Optional MOOC Wrapup (939).mp4 |
13.22Мб |
| 11-03 - Optional Meet the TAs (200).mp4 |
7.83Мб |
| lecture_slides_section1_1_meta_intro.pptx |
432.30Кб |
| lecture_slides_section1_10_lists.pptx |
111.17Кб |
| lecture_slides_section1_10_repl.txt |
2.45Кб |
| lecture_slides_section1_11_list_functions.pptx |
109.18Кб |
| lecture_slides_section1_11_list_functions.sml |
988б |
| lecture_slides_section1_12_let_expressions.pptx |
111.41Кб |
| lecture_slides_section1_12_let_expressions.sml |
341б |
| lecture_slides_section1_13_nested_functions.pptx |
109.85Кб |
| lecture_slides_section1_13_nested_functions.sml |
465б |
| lecture_slides_section1_14_let_efficiency.pptx |
121.46Кб |
| lecture_slides_section1_14_let_efficiency.sml |
904б |
| lecture_slides_section1_15_options.pptx |
109.79Кб |
| lecture_slides_section1_15_options.sml |
1.04Кб |
| lecture_slides_section1_16_booleans.pptx |
111.45Кб |
| lecture_slides_section1_17_no_mutation.pptx |
118.73Кб |
| lecture_slides_section1_18_optional_java_mutation.pptx |
108.20Кб |
| lecture_slides_section1_19_language_pieces.pptx |
103.52Кб |
| lecture_slides_section1_2_pl_intro.pptx |
113.13Кб |
| lecture_slides_section1_3_ML_expressions_and_variable_bindings.pptx |
109.76Кб |
| lecture_slides_section1_3_our_first_program.sml |
1.11Кб |
| lecture_slides_section1_4_rules_for_expressions.pptx |
118.16Кб |
| lecture_slides_section1_5_errors_fixed.sml |
344б |
| lecture_slides_section1_5_REPL_and_errors.pptx |
107.82Кб |
| lecture_slides_section1_5_some_errors.sml |
315б |
| lecture_slides_section1_6_shadowing.pptx |
108.72Кб |
| lecture_slides_section1_6_shadowing.sml |
298б |
| lecture_slides_section1_7_functions_informal.pptx |
109.69Кб |
| lecture_slides_section1_7_functions.sml |
332б |
| lecture_slides_section1_8_functions_formal.pptx |
112.17Кб |
| lecture_slides_section1_9_tuples.pptx |
115.67Кб |
| lecture_slides_section1_9_tuples.sml |
693б |
| lecture_slides_section1_IntBinaryTree.java |
610б |
| lecture_slides_section2_20_building_new_types.pptx |
105.76Кб |
| lecture_slides_section2_21_records.pptx |
109.89Кб |
| lecture_slides_section2_21_records.sml |
271б |
| lecture_slides_section2_22_tuples_as_syntactic_sugar.pptx |
103.88Кб |
| lecture_slides_section2_22_tuples_as_syntactic_sugar.sml |
633б |
| lecture_slides_section2_23_datatype_bindings.pptx |
108.32Кб |
| lecture_slides_section2_23_datatype_bindings.sml |
479б |
| lecture_slides_section2_24_case_expressions.pptx |
107.47Кб |
| lecture_slides_section2_24_case_expressions.sml |
415б |
| lecture_slides_section2_25_useful_datatypes.pptx |
115.34Кб |
| lecture_slides_section2_25_useful_datatypes.sml |
1.02Кб |
| lecture_slides_section2_26_precise_pattern_matching_sofar.pptx |
107.40Кб |
| lecture_slides_section2_27_type_synonyms.pptx |
104.23Кб |
| lecture_slides_section2_27_type_synonyms.sml |
1.01Кб |
| lecture_slides_section2_28_another_expression_example.pptx |
102.70Кб |
| lecture_slides_section2_28_another_expression_example.sml |
1.18Кб |
| lecture_slides_section2_29_list_and_option_datatypes.pptx |
110.57Кб |
| lecture_slides_section2_29_list_and_option_datatypes.sml |
656б |
| lecture_slides_section2_30_polymorphic_datatypes.pptx |
106.50Кб |
| lecture_slides_section2_30_polymorphic_datatypes.sml |
1.29Кб |
| lecture_slides_section2_31_eachof_pattern_matching.pptx |
128.16Кб |
| lecture_slides_section2_31_eachof_pattern_matching.sml |
861б |
| lecture_slides_section2_32_type_inference.pptx |
108.55Кб |
| lecture_slides_section2_32_type_inference.sml |
766б |
| lecture_slides_section2_33_polymorphic_and_equality_types.pptx |
113.04Кб |
| lecture_slides_section2_33_polymorphic_and_equality_types.sml |
537б |
| lecture_slides_section2_34_nested_patterns.pptx |
104.66Кб |
| lecture_slides_section2_34_nested_patterns.sml |
1.18Кб |
| lecture_slides_section2_35_more_nested_patterns.pptx |
101.59Кб |
| lecture_slides_section2_35_more_nested_patterns.sml |
929б |
| lecture_slides_section2_36_nested_patterns_precisely.pptx |
103.44Кб |
| lecture_slides_section2_37_function_patterns.pptx |
106.00Кб |
| lecture_slides_section2_37_function_patterns.sml |
689б |
| lecture_slides_section2_38_exceptions.pptx |
105.13Кб |
| lecture_slides_section2_38_exceptions.sml |
802б |
| lecture_slides_section2_39_tail_recursion.pptx |
119.15Кб |
| lecture_slides_section2_39_tail_recursion.sml |
255б |
| lecture_slides_section2_40_accumulators.pptx |
114.16Кб |
| lecture_slides_section2_40_accumulators.sml |
598б |
| lecture_slides_section2_41_tail_recursion_perspective.pptx |
105.06Кб |
| lecture_slides_section3_42_functions_intro.pptx |
107.90Кб |
| lecture_slides_section3_42_functions_intro.sml |
230б |
| lecture_slides_section3_43_functions_as_arguments.pptx |
105.58Кб |
| lecture_slides_section3_43_functions_as_arguments.sml |
1.31Кб |
| lecture_slides_section3_44_types_and_functions.pptx |
112.45Кб |
| lecture_slides_section3_44_types_and_functions.sml |
1.13Кб |
| lecture_slides_section3_45_anonymous_functions.pptx |
110.58Кб |
| lecture_slides_section3_45_anonymous_functions.sml |
1.01Кб |
| lecture_slides_section3_46_unnecessary_function_wrapping.pptx |
103.62Кб |
| lecture_slides_section3_46_unnecessary_function_wrapping.sml |
484б |
| lecture_slides_section3_47_map_and_filter.pptx |
106.67Кб |
| lecture_slides_section3_47_map_and_filter.sml |
657б |
| lecture_slides_section3_48_generalizing_prior_topics.pptx |
106.58Кб |
| lecture_slides_section3_48_generalizing_prior_topics.sml |
874б |
| lecture_slides_section3_49_lexical_scope.pptx |
112.09Кб |
| lecture_slides_section3_49_lexical_scope.sml |
457б |
| lecture_slides_section3_50_lexical_scope_and_functions.pptx |
112.79Кб |
| lecture_slides_section3_50_lexical_scope_and_functions.sml |
424б |
| lecture_slides_section3_51_why_lexical_scope.pptx |
112.42Кб |
| lecture_slides_section3_51_why_lexical_scope.sml |
1.25Кб |
| lecture_slides_section3_52_closures_and_recomputation.pptx |
104.45Кб |
| lecture_slides_section3_52_closures_and_recomputation.sml |
685б |
| lecture_slides_section3_53_fold_and_more_closures.pptx |
110.82Кб |
| lecture_slides_section3_53_fold_and_more_closures.sml |
940б |
| lecture_slides_section3_54_combining_functions.pptx |
116.36Кб |
| lecture_slides_section3_54_combining_functions.sml |
806б |
| lecture_slides_section3_55_currying.pptx |
116.69Кб |
| lecture_slides_section3_55_currying.sml |
1.24Кб |
| lecture_slides_section3_56_partial_application.pptx |
112.62Кб |
| lecture_slides_section3_56_partial_application.sml |
1.98Кб |
| lecture_slides_section3_57_currying_wrapup.pptx |
104.59Кб |
| lecture_slides_section3_57_currying_wrapup.sml |
535б |
| lecture_slides_section3_58_mutable_references.pptx |
106.93Кб |
| lecture_slides_section3_58_mutable_references.sml |
231б |
| lecture_slides_section3_59_callbacks.pptx |
110.72Кб |
| lecture_slides_section3_59_callbacks.sml |
942б |
| lecture_slides_section3_60_library_docs.pptx |
104.90Кб |
| lecture_slides_section3_61_adts_with_closures.pptx |
106.65Кб |
| lecture_slides_section3_61_adts_with_closures.sml |
1.48Кб |
| lecture_slides_section3_62_without_closures.pptx |
107.97Кб |
| lecture_slides_section3_62_without_closures.sml |
906б |
| lecture_slides_section3_63_java_without_closures.java |
1.84Кб |
| lecture_slides_section3_63_java_without_closures.pptx |
120.47Кб |
| lecture_slides_section3_64_c_without_closures.c |
2.16Кб |
| lecture_slides_section3_64_c_without_closures.pptx |
109.96Кб |
| lecture_slides_section4_65_section_introduction.pptx |
106.29Кб |
| lecture_slides_section4_66_what_is_type_inference.pptx |
106.01Кб |
| lecture_slides_section4_66_what_is_type_inference.sml |
279б |
| lecture_slides_section4_67_ML_type_inference.pptx |
107.60Кб |
| lecture_slides_section4_67_ml_type_inference.sml |
369б |
| lecture_slides_section4_68_type_inference_examples.pptx |
101.30Кб |
| lecture_slides_section4_68_type_inference_examples.sml |
2.29Кб |
| lecture_slides_section4_69_polymorphic_examples.pptx |
101.28Кб |
| lecture_slides_section4_69_polymorphic_examples.sml |
1.81Кб |
| lecture_slides_section4_70_other_inference.pptx |
121.41Кб |
| lecture_slides_section4_70_other_inference.sml |
580б |
| lecture_slides_section4_71_mutual_recursion.pptx |
109.83Кб |
| lecture_slides_section4_71_mutual_recursion.sml |
1.53Кб |
| lecture_slides_section4_72_namespace_mgmt.pptx |
108.74Кб |
| lecture_slides_section4_72_namespace_mgmt.sml |
364б |
| lecture_slides_section4_73_signatures.pptx |
113.46Кб |
| lecture_slides_section4_73_signatures.sml |
549б |
| lecture_slides_section4_74_module_example.pptx |
106.45Кб |
| lecture_slides_section4_74_module_example.sml |
1.58Кб |
| lecture_slides_section4_75_signatures_for_example.pptx |
119.66Кб |
| lecture_slides_section4_75_signatures_for_example.sml |
3.10Кб |
| lecture_slides_section4_76_signature_matching.pptx |
101.86Кб |
| lecture_slides_section4_77_equivalent_structure.pptx |
103.94Кб |
| lecture_slides_section4_77_equivalent_structure.sml |
2.78Кб |
| lecture_slides_section4_78_another_equivalent_structure.pptx |
106.57Кб |
| lecture_slides_section4_78_another_equivalent_structure.sml |
2.35Кб |
| lecture_slides_section4_79_modules_different_types.pptx |
106.79Кб |
| lecture_slides_section4_79_modules_different_types.sml |
3.97Кб |
| lecture_slides_section4_80_function_equivalence.pptx |
113.87Кб |
| lecture_slides_section4_81_standard_equivalences.pptx |
122.90Кб |
| lecture_slides_section4_82_equivalence_performance.pptx |
105.32Кб |
| lecture_slides_section5_100_memoization.pptx |
105.26Кб |
| lecture_slides_section5_100_memoization.rkt |
1009б |
| lecture_slides_section5_101_macros_intro.pptx |
111.14Кб |
| lecture_slides_section5_101_macros_intro.rkt |
1.20Кб |
| lecture_slides_section5_102_three_issues.pptx |
114.73Кб |
| lecture_slides_section5_103_define_syntax.pptx |
118.40Кб |
| lecture_slides_section5_103_define_syntax.rkt |
1.42Кб |
| lecture_slides_section5_104_hygiene.pptx |
120.96Кб |
| lecture_slides_section5_105_macro_examples.pptx |
101.64Кб |
| lecture_slides_section5_105_macro_examples.rkt |
1.22Кб |
| lecture_slides_section5_83_racket_intro.pptx |
106.65Кб |
| lecture_slides_section5_83_racket_intro.rkt |
386б |
| lecture_slides_section5_84_racket_basics.pptx |
114.82Кб |
| lecture_slides_section5_84_racket_basics.rkt |
1.07Кб |
| lecture_slides_section5_85_racket_lists.pptx |
104.54Кб |
| lecture_slides_section5_85_racket_lists.rkt |
849б |
| lecture_slides_section5_86_syntax_and_parens.pptx |
110.58Кб |
| lecture_slides_section5_87_parens_matter.pptx |
110.98Кб |
| lecture_slides_section5_87_parens_matter.rkt |
212б |
| lecture_slides_section5_88_dynamic_typing.pptx |
104.27Кб |
| lecture_slides_section5_88_dynamic_typing.rkt |
893б |
| lecture_slides_section5_89_cond.pptx |
108.83Кб |
| lecture_slides_section5_89_cond.rkt |
854б |
| lecture_slides_section5_90_local_bindings.pptx |
116.49Кб |
| lecture_slides_section5_90_local_bindings.rkt |
1.71Кб |
| lecture_slides_section5_91_toplevel_bindings.pptx |
105.13Кб |
| lecture_slides_section5_91_toplevel_bindings.rkt |
623б |
| lecture_slides_section5_92_setbang.pptx |
112.98Кб |
| lecture_slides_section5_92_setbang.rkt |
906б |
| lecture_slides_section5_93_truth_about_cons.pptx |
105.08Кб |
| lecture_slides_section5_93_truth_about_cons.rkt |
457б |
| lecture_slides_section5_94_mcons.pptx |
106.09Кб |
| lecture_slides_section5_94_mcons.rkt |
545б |
| lecture_slides_section5_95_thunks.pptx |
108.99Кб |
| lecture_slides_section5_95_thunks.rkt |
603б |
| lecture_slides_section5_96_avoid_unnecessary.pptx |
104.91Кб |
| lecture_slides_section5_96_avoid_unnecessary.rkt |
1.63Кб |
| lecture_slides_section5_97_delay_force.pptx |
109.00Кб |
| lecture_slides_section5_97_delay_force.rkt |
1.63Кб |
| lecture_slides_section5_98_using_streams.pptx |
106.82Кб |
| lecture_slides_section5_98_using_streams.rkt |
1.10Кб |
| lecture_slides_section5_99_defining_streams.pptx |
108.04Кб |
| lecture_slides_section5_99_defining_streams.rkt |
1.10Кб |
| lecture_slides_section6_106_section_topics.pptx |
101.68Кб |
| lecture_slides_section6_107_datatypes_without_structs.pptx |
119.24Кб |
| lecture_slides_section6_107_datatypes_without_structs.rkt |
2.67Кб |
| lecture_slides_section6_107_datatypes_without_structs.sml |
1.54Кб |
| lecture_slides_section6_108_datatypes_with_structs.pptx |
117.53Кб |
| lecture_slides_section6_108_datatypes_with_structs.rkt |
921б |
| lecture_slides_section6_109_why_structs.pptx |
114.01Кб |
| lecture_slides_section6_110_implement_a_language.pptx |
123.68Кб |
| lecture_slides_section6_111_interpreter_assumptions.pptx |
114.83Кб |
| lecture_slides_section6_111_interpreter_assumptions.rkt |
3.81Кб |
| lecture_slides_section6_112_implementing_variables.pptx |
107.73Кб |
| lecture_slides_section6_113_implementing_closures.pptx |
106.86Кб |
| lecture_slides_section6_114_closures_efficient.pptx |
106.98Кб |
| lecture_slides_section6_115_macros_via_functions.pptx |
109.96Кб |
| lecture_slides_section6_115_macros_via_functions.rkt |
3.13Кб |
| lecture_slides_section6_116_ml_vs_racket.pptx |
112.58Кб |
| lecture_slides_section6_117_what_is_static_checking.pptx |
109.35Кб |
| lecture_slides_section6_118_soundness_completeness.pptx |
108.27Кб |
| lecture_slides_section6_119_weak_typing.pptx |
107.32Кб |
| lecture_slides_section6_120_static_vs_dynamic_one.pptx |
126.53Кб |
| lecture_slides_section6_120_static_vs_dynamic_one.rkt |
752б |
| lecture_slides_section6_120_static_vs_dynamic_one.sml |
955б |
| lecture_slides_section6_121_static_vs_dynamic_two.pptx |
119.28Кб |
| lecture_slides_section6_122_eval.pptx |
108.34Кб |
| lecture_slides_section6_122_eval.rkt |
527б |
| lecture_slides_section7_123_ruby_intro.pptx |
111.49Кб |
| lecture_slides_section7_123_ruby_intro.rb |
205б |
| lecture_slides_section7_124_classes_objects.pptx |
109.91Кб |
| lecture_slides_section7_124_classes_objects.rb |
778б |
| lecture_slides_section7_125_object_state.pptx |
109.80Кб |
| lecture_slides_section7_125_object_state.rb |
1.19Кб |
| lecture_slides_section7_126_visibility.pptx |
116.65Кб |
| lecture_slides_section7_127_example.pptx |
101.59Кб |
| lecture_slides_section7_127_example.rb |
2.47Кб |
| lecture_slides_section7_128_all_objects.pptx |
106.75Кб |
| lecture_slides_section7_129_classes_dynamic.pptx |
104.95Кб |
| lecture_slides_section7_129_classes_dynamic.rb |
502б |
| lecture_slides_section7_130_duck_typing.pptx |
108.66Кб |
| lecture_slides_section7_131_arrays.pptx |
103.12Кб |
| lecture_slides_section7_131_arrays.rb |
959б |
| lecture_slides_section7_132_blocks.pptx |
107.38Кб |
| lecture_slides_section7_132_blocks.rb |
646б |
| lecture_slides_section7_133_using_blocks.pptx |
103.00Кб |
| lecture_slides_section7_133_using_blocks.rb |
456б |
| lecture_slides_section7_134_procs.pptx |
106.96Кб |
| lecture_slides_section7_134_procs.rb |
366б |
| lecture_slides_section7_135_hashes_ranges.pptx |
104.43Кб |
| lecture_slides_section7_135_hashes_ranges.rb |
619б |
| lecture_slides_section7_136_subclassing.pptx |
110.79Кб |
| lecture_slides_section7_136_subclassing.rb |
1.02Кб |
| lecture_slides_section7_137_why_subclassing.pptx |
111.83Кб |
| lecture_slides_section7_138_overriding.pptx |
108.56Кб |
| lecture_slides_section7_138_overriding.rb |
1.57Кб |
| lecture_slides_section7_139_method_lookup.pptx |
112.87Кб |
| lecture_slides_section7_140_dynamic_dispatch_vs_closures.pptx |
108.41Кб |
| lecture_slides_section7_140_dynamic_dispatch_vs_closures.rb |
719б |
| lecture_slides_section7_140_dynamic_dispatch_vs_closures.sml |
596б |
| lecture_slides_section7_141_manual_dynamic_dispatch.pptx |
131.39Кб |
| lecture_slides_section7_141_manual_dynamic_dispatch.rkt |
3.95Кб |
| lecture_slides_section8_142_fp_oo_decomposition.java |
1.58Кб |
| lecture_slides_section8_142_fp_oo_decomposition.pptx |
116.32Кб |
| lecture_slides_section8_142_fp_oo_decomposition.rb |
1.37Кб |
| lecture_slides_section8_142_fp_oo_decomposition.sml |
1.09Кб |
| lecture_slides_section8_143_adding_operations_or_variants.java |
2.68Кб |
| lecture_slides_section8_143_adding_operations_or_variants.pptx |
111.78Кб |
| lecture_slides_section8_143_adding_operations_or_variants.rb |
2.02Кб |
| lecture_slides_section8_143_adding_operations_or_variants.sml |
1.86Кб |
| lecture_slides_section8_144_binary_methods_fp.pptx |
115.01Кб |
| lecture_slides_section8_144_binary_methods_fp.sml |
2.53Кб |
| lecture_slides_section8_145_double_dispatch.java |
4.32Кб |
| lecture_slides_section8_145_double_dispatch.pptx |
121.14Кб |
| lecture_slides_section8_145_double_dispatch.rb |
4.05Кб |
| lecture_slides_section8_146_multimethods.pptx |
106.99Кб |
| lecture_slides_section8_147_multiple_inheritance.pptx |
115.38Кб |
| lecture_slides_section8_147_multiple_inheritance.rb |
880б |
| lecture_slides_section8_148_mixins.pptx |
111.90Кб |
| lecture_slides_section8_148_mixins.rb |
1.96Кб |
| lecture_slides_section8_149_interfaces.pptx |
111.99Кб |
| lecture_slides_section8_150_abstract_methods.pptx |
115.08Кб |
| lecture_slides_section8_151_subtyping.pptx |
118.77Кб |
| lecture_slides_section8_152_subtype_relation.pptx |
105.73Кб |
| lecture_slides_section8_153_depth_subtyping.pptx |
111.58Кб |
| lecture_slides_section8_154_java_arrays.pptx |
110.31Кб |
| lecture_slides_section8_155_function_subtyping.pptx |
121.76Кб |
| lecture_slides_section8_156_object_subtyping.pptx |
111.62Кб |
| lecture_slides_section8_157_generics_versus_subtyping.pptx |
114.35Кб |
| lecture_slides_section8_158_bounded_polymorphism.pptx |
116.93Кб |
| lecture_slides_section8_section8sum.pdf |
246.30Кб |
| lecture_slides_sectionMotivation_m1_motivation_intro.pptx |
110.04Кб |
| lecture_slides_sectionMotivation_m2_motivation_general.pptx |
113.00Кб |
| lecture_slides_sectionMotivation_m3_pls_the_same.pptx |
103.15Кб |
| lecture_slides_sectionMotivation_m4_why_functional.pptx |
110.44Кб |
| lecture_slides_sectionMotivation_m5_why_these_languages.pptx |
110.96Кб |