SIGN IN
SIGN UP
Definitional interpreters for higher-order programming languages
Full Text:
PDF
Buy this Article
Author:
John C. Reynolds
Published in:
· Proceeding
ACM '72 Proceedings of the ACM annual conference - Volume 2
Pages 717-740
ACM
New York, NY
, USA
©1972
table of contents
doi>
10.1145/800194.805852
1972 Article
Bibliometrics
· Downloads (6 Weeks): 15
· Downloads (12 Months): 64
· Downloads (cumulative): 894
· Citation Count: 173
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
applicative language
closure
continuation
gedanken
higher-order function
interpreter
interpreters
j-operator
lambda calculus
language definition
languages
lisp
order of application
pal
programming language
reference
secd machine
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder