Using Untypes Lambda Calculus to Computer with Atoms
| dc.contributor.advisor | Meyer, Albert R. | en_US |
| dc.contributor.author | Weiss, Paul G. | en_US |
| dc.date.accessioned | 2023-03-29T15:10:41Z | |
| dc.date.available | 2023-03-29T15:10:41Z | |
| dc.date.issued | 1984-02 | |
| dc.identifier.uri | https://hdl.handle.net/1721.1/149598 | |
| dc.description.abstract | Axioms and verification rules are given for typeless A -calculus with a conditional test for equality between atoms. A semantic completeness theorem is proved and a deterministic evaluator is proposed. | en_US |
| dc.relation.ispartofseries | MIT-LCS-TR-325 | |
| dc.title | Using Untypes Lambda Calculus to Computer with Atoms | en_US |
| dc.identifier.oclc | 13591089 |
