Now showing items 1-1 of 1

    • Using Untypes Lambda Calculus to Computer with Atoms 

      Weiss, Paul G. (1984-02)
      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.