Using Untypes Lambda Calculus to Computer with Atoms

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.

Bibliographic Details
Main Author: Weiss, Paul G.
Other Authors: Meyer, Albert R.
Published: 2023
Online Access:https://hdl.handle.net/1721.1/149598
_version_ 1811087207906148352
author Weiss, Paul G.
author2 Meyer, Albert R.
author_facet Meyer, Albert R.
Weiss, Paul G.
author_sort Weiss, Paul G.
collection MIT
description 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.
first_indexed 2024-09-23T13:41:47Z
id mit-1721.1/149598
institution Massachusetts Institute of Technology
last_indexed 2024-09-23T13:41:47Z
publishDate 2023
record_format dspace
spelling mit-1721.1/1495982023-03-30T03:36:35Z Using Untypes Lambda Calculus to Computer with Atoms Weiss, Paul G. Meyer, Albert R. 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. 2023-03-29T15:10:41Z 2023-03-29T15:10:41Z 1984-02 https://hdl.handle.net/1721.1/149598 13591089 MIT-LCS-TR-325 application/pdf
spellingShingle Weiss, Paul G.
Using Untypes Lambda Calculus to Computer with Atoms
title Using Untypes Lambda Calculus to Computer with Atoms
title_full Using Untypes Lambda Calculus to Computer with Atoms
title_fullStr Using Untypes Lambda Calculus to Computer with Atoms
title_full_unstemmed Using Untypes Lambda Calculus to Computer with Atoms
title_short Using Untypes Lambda Calculus to Computer with Atoms
title_sort using untypes lambda calculus to computer with atoms
url https://hdl.handle.net/1721.1/149598
work_keys_str_mv AT weisspaulg usinguntypeslambdacalculustocomputerwithatoms