added vijayan's talk, only first day by request
This commit is contained in:
parent
e8be25672f
commit
d449451831
|
@ -11,6 +11,32 @@
|
||||||
CD or DVD should you so choose.
|
CD or DVD should you so choose.
|
||||||
<ul class="media">
|
<ul class="media">
|
||||||
|
|
||||||
|
<mediaitem date="2015-03-09" time="6:00 PM" room="MC 4040"
|
||||||
|
title="Runtime Type Inference in Dynamic Languages">
|
||||||
|
<abstract>
|
||||||
|
<p>
|
||||||
|
How do we make dynamic languages fast? Today, modern Javascript engines
|
||||||
|
have demonstrated that programs written in dynamically typed scripting lan-
|
||||||
|
guages can be executed close to the speed of programs written in languages
|
||||||
|
with static types. So how did we get here? How do we extract precious type
|
||||||
|
information from programs at runtime? If any variable can hold a value of any
|
||||||
|
type, then how can we optimize well?
|
||||||
|
</p>
|
||||||
|
<p>
|
||||||
|
This talk covers a bit of the history of the techniques used in this space, and
|
||||||
|
tries to summarize, in broad strokes, how those techniques come together to
|
||||||
|
enable efficient jit-compilation of dynamically typed programs.
|
||||||
|
To do the topic justice, Kannan Vijayan will be talking the Monday and
|
||||||
|
Tuesday March 9th and 10th.
|
||||||
|
</p>
|
||||||
|
<p>
|
||||||
|
Does that mean two consecutive days of free food? Yes it does.
|
||||||
|
</p>
|
||||||
|
</abstract>
|
||||||
|
<thumbnail file="vijayan-day-1-thumb-small.jpg" />
|
||||||
|
<mediafile file="vijayan-day-1.mp4" type="Talk (x264)" />
|
||||||
|
</mediaitem>
|
||||||
|
|
||||||
<mediaitem title="SAT and SMT solvers">
|
<mediaitem title="SAT and SMT solvers">
|
||||||
<abstract>
|
<abstract>
|
||||||
<p>
|
<p>
|
||||||
|
|
Loading…
Reference in New Issue