The Tail-Recursive SECD Machine

@article{Ramsdell1999TheTS,
  title={The Tail-Recursive SECD Machine},
  author={John D. Ramsdell},
  journal={Journal of Automated Reasoning},
  year={1999},
  volume={23},
  pages={43-62}
}
One method for producing verified implementations of programming languages is to formally derive them from abstract machines. Tail-recursive abstract machines provide efficient support for iterative processes via the ordinary procedure call mechanism. This document argues that the use of tail-recursive abstract machines incurs only a small increase in theorem-proving burden when compared with what is required when using ordinary abstract machines. The position is supported by comparing… CONTINUE READING
10 Citations
23 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 23 references

The Lambda Calculus, Its Syntax and Semantics

  • H. P. Barendregt
  • 1984
Highly Influential
7 Excerpts

Machines, and Goedel’s Proof

  • Shankar, N.Metamathematics
  • J. D. RAMSDELL
  • 1999
1 Excerpt

Plotkin . Call - byname , call - by - value and the λ - calculus

  • D Gordon
  • The ­ oretical Computer Science
  • 1998

TR-SECD Events

  • J. D. Ramsdell
  • NQTHM event file,
  • 1996
2 Excerpts

ftp://ftp.cs.utexas.edu/pub/ boyer/nqthm/trsecd/secd.events

  • J. D. Ramsdell
  • SECD Events, NQTHM event file,
  • 1996
2 Excerpts

Guttman and Mitchell Wand ( eds . ) . VLISP : A Verified Implementation of Scheme

  • D. Joshua
  • 1995

Ramsdell . TR - SECD events . NQTHM event file , September 1996

  • D. John
  • Metamathematics , Machines , and Goedel ’ s Proof
  • 1994

Similar Papers

Loading similar papers…