Using Untypes Lambda Calculus to Computer with Atoms

Author(s)
Weiss, Paul G.
Thumbnail
DownloadMIT-LCS-TR-325.pdf (1.171Mb)
Advisor
Meyer, Albert R.
Metadata
Show full item record
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.
Date issued
1984-02
URI
https://hdl.handle.net/1721.1/149598
Series/Report no.
MIT-LCS-TR-325
Collections