Index of /courseware/cse3322/2006/03concepts

 Name                    Last modified       Size  Description

 Parent Directory        12-Dec-2006 14:37      -  
 slides_bw.pdf           31-Jul-2006 12:08   282k  
 slides_bw2x2.pdf        31-Jul-2006 12:08   201k  

Concepts

Also see

[λ-calculus], [intro], [examples] including [Y],

[Prolog], [intro], [examples], [solar] as in p.78+, [witches] as in Monty Python,

[block structure], [Algol-60] including [by-name params],

[Java & scope],

[glossary].

There is a connection between type-checking and logic.

E.g. The SML type of the identity function, id:'t->'t], can be represented in Prolog (predicate logic) as arrow(T,T).

It can be instantiated to int->int,  that is arrow(int,int), say, but not to int->bool,  that is arrow(int,bool), say.

E.g. map : ('a->'b)->'a list->'b list,   map's type can be represented as arrow(arrow(A,B), arrow(list(A), list(B))). If this is matched against arrow(arrow(char,int), arrow(list(char), T)) we not only discover that it does match but also that A = char, B = int, and T = list(int).