A static semantics for labels in OCaml

In this thesis, we are proposing a type system and a type inferencer for the label-feature of OCaml. Labels in OCaml allow the naming of arguments to functions and are intended to document the code. We provide a type system that describes whether a derived type for an OCaml expression containing labels is correct or not, a type inference algorithm, and show that OCaml’s function application does not strictly support currying.

Name thesis:degree_name

M.S.

Level thesis:degree_level

Thesis

Discipline thesis:degree_discipline

Computer Science

Grantor

University of Illinois at Urbana-Champaign

Year dc:date

2016

Author dc:creator

• Bay, Michael

Contributors dc:contributor

• Gunter, Elsa

• OCaml

Statement dc:rights

• Copyright 2016 Michael Bay

Language dc:language

en

Handle dc:identifier

http://hdl.handle.net/2142/92854

OAI identifier oai:identifier

oai:www.ideals.illinois.edu:2142/92854