-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathsyllabus.html
186 lines (160 loc) · 4.59 KB
/
syllabus.html
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
<!DOCTYPE html>
<html lang="en">
<head>
<title>Syllabus for UCLA Computer Science 131</title>
<meta charset="UTF-8">
<link rel='author' href='mailto:eggert@cs.ucla.edu'>
<link rel='license' href='copyright.html'>
</head>
<body>
<h1>Syllabus for UCLA Computer Science 131</h1>
<p><small>[<a href='index.html'>131 home</a>]</small></p>
<h2>Texts</h2>
<h3>Required text</h3>
<ul>
<li>
Adam Brooks Webber,
<a href='https://fbeedle.com/our-books/13-modern-programming-languages-a-practical-introduction-2nd-ed-9781590282502.html'><em>Modern Programming Languages:
A Practical Introduction</em>, 2nd edition</a>,
Franklin, Beedle & Associates, ISBN 978-1-59028-250-2 (2011).
<a href='https://web.archive.org/web/20170209042729/http://www.webber-labs.com/wp-content/uploads/2015/08/mpl-errata.pdf'>Errata</a> [PDF] are available.</li>
</ul>
<h2>Topics</h2>
<h3>Language design issues</h3>
<ul>
<li>efficiency, safety, convenience</li>
<li>programming categories
<ul>
<li>procedural</li>
<li>functional</li>
<li>object-oriented</li>
<li>declarative</li>
<li>scripting</li>
</ul>
</li>
<li>scaling problems</li>
<li>history and evolution of programming languages</li>
</ul>
<h3>functions</h3>
<ul>
<li>motivation</li>
<li>recursion and tail recursion</li>
<li>activation records</li>
<li>functions as data</li>
<li>closures</li>
<li>debugging via divide and conquer</li>
<li>persistence</li>
<li>amortized efficiency</li>
</ul>
<h3>syntax</h3>
<ul>
<li>tokenization</li>
<li>grammars</li>
</ul>
<h3>names</h3>
<ul>
<li>names, binding, visibility, scope, lifetime</li>
<li>static vs dynamic scope</li>
</ul>
<h3>types</h3>
<ul>
<li>type, values, operations</li>
<li>type checking and conversion</li>
<li>elementary and structured types</li>
<li>explicit vs implicit storage management</li>
<li>stack vs heap</li>
</ul>
<h3>control</h3>
<ul>
<li>expression evaluation</li>
<li>rewrite rules</li>
<li>pattern matching, unification, and backtracking</li>
<li>structured programs</li>
</ul>
<h3>objects</h3>
<ul>
<li>object-oriented design</li>
<li>encapsulation and data abstraction</li>
<li>separating behavior from implementation</li>
<li>classes and class hierarchies</li>
<li>inheritance</li>
<li>polymorphism</li>
<li>collections and iteration</li>
</ul>
<h3>exceptions</h3>
<ul>
<li>design issues</li>
<li>when not to use exceptions</li>
<li>case study: exceptions in Java</li>
</ul>
<h3>concurrency</h3>
<ul>
<li>competition and cooperation</li>
<li>synchronization</li>
<li>case study: multithreading in Java</li>
</ul>
<h3>semantics</h3>
<ul>
<li>lambda calculus</li>
<li>program verification</li>
</ul>
<h2>Language paradigms</h2>
<h3>Java</h3>
<ul>
<li>primitive and reference types</li>
<li>classes and instances</li>
<li>variables, methods, constructors, and overloading</li>
<li>inheritance, abstract classes, final classes, and interfaces</li>
<li>compilation units, packages and visibility</li>
<li>the <samp>Object</samp> class</li>
<li>Java class library basics</li>
<li>collections</li>
<li>exceptions</li>
<li>threads</li>
</ul>
<h3>OCaml</h3>
<ul>
<li>type inference and annotations</li>
<li>pattern matching</li>
<li>polymorphism</li>
<li>higher-order functions and currying</li>
<li>type constructors</li>
</ul>
<h3>Prolog</h3>
<ul>
<li>propositional logic</li>
<li>predicate calculus: instantiation, atoms, variables, structures</li>
<li>clausal form and Horn clauses</li>
<li>the resolution principle</li>
<li>depth-first backward chaining with backtracking</li>
<li>debugging</li>
<li>memory management</li>
<li>the closed world assumption</li>
</ul>
<h3>Python</h3>
<ul>
<li>the Python shell</li>
<li>scripting</li>
<li>functional and object-oriented programming</li>
<li>modules and packages</li>
<li>Python library basics</li>
<li>extending and embedding</li>
</ul>
<h3>Scheme</h3>
<ul>
<li>syntax</li>
<li>lists</li>
<li>comparison (e.g., <samp>eq?</samp> vs <samp>equal?</samp>)</li>
<li>syntactic forms: core and extension</li>
<li><samp>let</samp> and <samp>lambda</samp></li>
<li>tail recursion</li>
<li>continuations</li>
</ul>
<hr>
<address>
© 2003, 2004–2006, 2010–2011 <a href='mail-eggert.html'>Paul Eggert</a>.
See <a href='copyright.html'>copying rules</a>.<br>
$Id: syllabus.html,v 1.19 2018/04/03 16:18:23 eggert Exp eggert $
</address>
</body>
</html>