F. L. Morris, Correctness of Translations of Programming Languages--An Algebraic Ap- proach, Stanford U. Report CS-72-303, August 1972. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Unknown - Warning Concerning Copyright (Correct)
....f; U (N; 0, succ; where r(x) x ifx Dom and r(x) is unde T fined if x N. The same result holds for relation r. Proof An effective scheme over can be simulated by a flowchart scheme over u(N;0, succ; by allowing (N;0, succ; to code the recursively enumerable control steps as in [28, 3]. The availability of flowcharts over (N; 0, succ; essentially allows the simulation of any finite number of counters. Results of application of functions can be represented as numerically coded formal expressions until a basic relation of is to be applied (or until an output is ....
F. L. Morris, Correctness of Translations of Programming Languages--An Algebraic Ap- proach, Stanford U. Report CS-72-303, August 1972.
A Verified Code Generator For A Subset Of Gypsy - Young (1988) (14 citations) (Correct)
....takes recursive functions to Turing machine code. The work of Burstall and Landin [BurstallLandin 69] formalizes the semantics algebraically and proves the equivalence of the results of the functions describing the source and target languages. This apparently inspired the similar work of Morris [Morris 72, Morris 73] and Chirica [Chirica 76] Milne and Strachey [MilneStrachey 76] give a hand proof of a compiler for a language of approximately the complexity of Algol 68. Cohn [Cohn 79a, Cohn 79b] proves several components of a compiler using Edinburgh LCF. The intricacies of denotational semantics ....
F.L. Morris. Correctness of Translations of Programming Languages--An Algebraic Approach. Technical Report AIM-174, Stanford Univerity Artificial Intelligence Laboratory, August, 1972.
Formal Methods - Selected Historical References - Jones, McCauley (1992) (1 citation) (Correct)
No context found.
F. L. Morris. Correctness of Translations of Programming Languages -- An Algebraic Approach. PhD thesis, Computer Science Department, Stanford University, August 1972. Printed as STANCS -72-303.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC