LCS Technical Memos (1974 - 2003): Recent submissions

Now showing items 271-273 of 486

    • Understanding ALGOL: A View of a Recent Convert to Denotational Semantics 

      Meyer, Albert R. (1983-10)
      The advantages of denotational over copy-rule semantics are argued. A denotational semantics is indicated for an ALGOL-like language with finite-mode procedures, blocks with local storage, and sharing (aliasing). Procedure ...

    • How to Construct Random Functions 

      Goldreich, Oded; Goldwasser, Shafi; Micali, Silvio (1982-11)
      We assume that functions that are one-way in a very weak sense exist. We prove that in probabilitic polynomial time it is possible to construct deterministic polynomial time computable functions g:{1,…,2^k} -> {1,…,2^k} ...

    • Efficient Demand-Driven Evaluation (II) 

      Pingali, Keshav; Arvind (1983-09)
      In Part I of this paper, we presented a scheme whereby a compiler could propogate demands through programs in a powerful stream language L. A data-driven evaluation of the transformed program performed exactly the same ...