ACM Home Page
Please provide us with feedback. Feedback
Executing an SECD machine using logic programming
Full text PdfPdf (438 KB)
Source Technical Symposium on Computer Science Education archive
Proceedings of the twenty-sixth SIGCSE technical symposium on Computer science education table of contents
Nashville, Tennessee, United States
Pages: 228 - 232  
Year of Publication: 1995
ISBN:0-89791-693-X
Also published in ...
Author
Ken Slonneger  The University of Iowa, Iowa City, Iowa
Sponsor
SIGCSE: ACM Special Interest Group on Computer Science Education
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 13,   Downloads (12 Months): 24,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/199688.199793
What is a DOI?

ABSTRACT

Students usually find formal methods of describing programming languages very difficult because of the cryptic notation, the complexity of the techniques, and the size of the specifications. The SECD abstract machine provides a small but clear description of the operational semantics of the lambda calculus. By implementing the SECD machine in Prolog, we give students a tool for testing specifications and for experimenting with alternate language semantics in an interactive setting.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
Anthony Field and Peter Harrison, Functional Programruing, Addison-Wesley, 1988.
 
3
 
4
Peter Landin, "The Mechnical Evaluation of Expressions" The Computer Journal, 6.4, January 1964, pp. 308-320.
 
5
Peter Landin, "A l-Calculus Approach" in Advances in Progranvning and Non-numerical Computation, Edited by Leslie Fox, Pergamon Press, 1966, pp. 97-141
 
6