Abstract
The paper is devoted to procedural semantics that use interpretation algorithms on which interpreters of untyped functional programming systems are based (or can be based). The aim of this study is to describe such algorithms and compare procedural semantics based on them both with each other and with the basic semantics defined by means of the fixed-point combinator Y.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
