Towards machine-checked compiler correctness for higher-order pure functional languages-Reference-Cited by-同舟云学术

Towards machine-checked compiler correctness for higher-order pure functional languages

Published:1995 Issue: Volume: Page:369-381
ISSN:0302-9743
Container-title:Computer Science Logic
language:
Short-container-title:

Author:

Lester David,Mintchev Sava

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/BFb0022269

Reference20 articles.

1. A. Cohn. The equivalence of two semantic definitions: a case study in LCF. Technical Report CSR-76-81, Department of Computer Science, Edinburgh University, January 1981.

2. P. Curzon. Deriving correctness properties of compiled code. Formal Methods in System Design, 3(1/2):83–115, August 1993.

3. D.R. Lester. The G-machine as a representation of stack semantics. In G. Kahn, editor, Proceedings of the Functional Programming Languages and Computer Architecture Conference, pages 46–59. Springer-Verlag LNCS 274, September 1987.

4. D.R. Lester. Combinator Graph Reduction: A Congruence and its Applications. Dphil thesis, Oxford University, 1988. Also published as Technical Monograph PRG-73.

5. R.E. Milne. The Formal Semantics of Computer Languages and Their Implementation. PhD thesis, University of Cambridge, 1974.

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

1. Multi-level Meta-reasoning with Higher-Order Abstract Syntax;Lecture Notes in Computer Science;2003

2. The correctness of a higher-order lazy functional language implementation: An exercise in mechanical theorem proving;Higher-Order Algebra, Logic, and Term Rewriting;1996

3. Inducing students to induct;Funtional Programming Languages in Education;1995