A Caltech Library Service

A comparison of strict and non-strict semantics for lists


Burch, Jerry R. (1988) A comparison of strict and non-strict semantics for lists. Master's thesis, California Institute of Technology.


No abstract.

Item Type:Thesis (Master's thesis)
Subject Keywords:Computer Science
Degree Grantor:California Institute of Technology
Division:Engineering and Applied Science
Major Option:Computer Science
Thesis Availability:Restricted to Caltech community only
Research Advisor(s):
  • Martin, Alain J.
Thesis Committee:
  • Unknown, Unknown
Defense Date:1 January 1988
Other Numbering System:
Other Numbering System NameOther Numbering System ID
Record Number:CaltechTHESIS:03262012-113851465
Persistent URL:
Default Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:6868
Deposited By: Benjamin Perez
Deposited On:26 Mar 2012 18:46
Last Modified:26 Dec 2012 04:41

Thesis Files

[img] PDF - Final Version
Restricted to Caltech community only
See Usage Policy.


Repository Staff Only: item control page