Burch, Jerry R. (1988) A Comparison of Strict and Non-Strict Semantics for Lists. California Institute of Technology . (Unpublished) https://resolver.caltech.edu/CaltechCSTR:1988.cs-tr-88-12
![[img]](https://authors.library.caltech.edu/style/images/fileicons/application_postscript.png)
|
Postscript
See Usage Policy. 3MB | |
![[img]](https://authors.library.caltech.edu/style/images/fileicons/other.png)
|
Other (Adobe PDF (3.4MB))
See Usage Policy. 3MB |
Use this Persistent URL to link to this item: https://resolver.caltech.edu/CaltechCSTR:1988.cs-tr-88-12
Abstract
No abstract available.
| Item Type: | Report or Paper (Technical Report) |
|---|---|
| Group: | Computer Science Technical Reports |
| Record Number: | CaltechCSTR:1988.cs-tr-88-12 |
| Persistent URL: | https://resolver.caltech.edu/CaltechCSTR:1988.cs-tr-88-12 |
| Usage Policy: | You are granted permission for individual, educational, research and non-commercial reproduction, distribution, display and performance of this work in any format. |
| ID Code: | 26698 |
| Collection: | CaltechCSTR |
| Deposited By: | Imported from CaltechCSTR |
| Deposited On: | 24 Apr 2001 |
| Last Modified: | 03 Oct 2019 03:17 |
Repository Staff Only: item control page
