CS 6110 Spring 2013
Overview Programming languages are a fundamental part of computer science. This course introduces the formal tools needed to describe precisely what a program means. These tools help us answer many useful questions about program analyses and transformations, such as: Is this program correct? Will this program encounter a run-time type error? Is one program indistinguishable from another? Is this o
Lecture 26: Type Inference and Unification
Type inference refers to the process of determining the appropriate types for expressions based on how they are used. For example, in the expression f 3, OCaml knows that f must be a function, because it is applied to something (not because its name is f!) and that it takes an int as input. It knows nothing about the output type. Therefore the type inference mechanism of OCaml would assign f the
1
リリース、障害情報などのサービスのお知らせ
最新の人気エントリーの配信
処理を実行中です
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く
http://www.cs.cornell.edu/courses/cs6110/2013sp/lectures/lec30-sp13.pdf
CS 3110 - Spring 2013 - Lecture Notes
Installing Course Software
