Joseph E. Stoy: The Congruence of Two Programming Language Definitions, Theoretical Computer Science, Vol. 13 pp 151-174 (1981)  Home/Search   Document Not in Database   Summary   Related Articles

.... between the meta continuation semantics and an ordinary continuation semantics: Emc [ E] ae mc fl = fl (Ec [ E] ae c ) completely analogous to the traditional congruence between continuation and direct semantics: Ec [ E] ae c = Ed [ E] ae d) where ae d and ae c are related in the usual way [Stoy 81] In particular, results concerning recursion and the problem of nontermination can be carried over directly. 2 Metacircular Interpreters and Compilers The traditional CPS translation equations of the last section, while simple, tend to produce unnecessarily large results. The problem is that ....

Joseph E. Stoy: The Congruence of Two Programming Language Definitions, Theoretical Computer Science, Vol. 13 pp 151-174 (1981)

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