Using Untypes Lambda Calculus to Computer with Atoms

Thumbnail Image
Download
Name

MIT-LCS-TR-325.pdf

Size

1.17 MB

Format

Adobe PDF

Checksum (MD5)

dda1abc1a0f5e74b7f4de3291f51f84b

Author(s)
Weiss, Paul G.
Advisor(s)
Meyer, Albert R.
Date Issued
February 1984
Series/Report no.
MIT-LCS-TR-325
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.
Persistent DSpace Link
PrivacyPermissionsAccessibilityContact us
Notify us about copyright concerns.