Correctness of procedure representations in higher-order assembly language-Reference-Cited by-同舟云学术

Correctness of procedure representations in higher-order assembly language

Published:1992 Issue: Volume: Page:294-311
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Wand Mitchell

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-55511-0_15.pdf

Reference21 articles.

1. Appel, A.W., and Jim, T., “Continuation-Passing, Closure-Passing Style,” Conf. Rec. 16th ACM Symp. on Principles of Programming Languages (1989), 293–302.

2. Barendregt, H.P. The Lambda Calculus: Its Syntax and Semantics, North-Holland, Amsterdam, 1981.

3. Boyer, R.S., and Moore, J S. “The Sharing of Structure in Theorem-Proving Programs,” in Machine Intelligence 7 (B. Meltzer & D. Michie, eds), Edinburgh University Press (1972), 101–116.

4. Church, A. “A formulation of the simple theory of types,” J. of Symbolic Logic 5 (1940), 56–68.

5. Clinger, W. “The Scheme 311 Compiler: An Exercise in Denotational Semantics,” Conf. Rec. 1984 ACM Symposium on Lisp and Functional Programming (August, 1984), 356–364.

Cited by 12 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On one-pass CPS transformations;Journal of Functional Programming;2007-11

2. Mobile Resource Guarantees for Smart Devices;Construction and Analysis of Safe, Secure, and Interoperable Smart Devices;2005

3. Grail: a functional form for imperative mobile code;Electronic Notes in Theoretical Computer Science;2003-09

4. Compiler Construction in Higher Order Logic Programming;Practical Aspects of Declarative Languages;2001-12-20

5. Compiling Lazy Functional Programs Based on the Spineless Tagless G-machine for the Java Virtual Machine;Functional and Logic Programming;2001