Abstract
In ordinary interpreters and executable specifications of operational semantics the interpreted language is represented by an algebraic data type and the operations are functions having this data type as argument. In this essay we reverse the roles of functions and data structures. Here the language constructs are represented by state transforming functions belonging to some class. There are instances of this class for the operations on the specified language. Typical examples of operations are reduction, pretty printing, and transformations. The state is a data structure indicating the desired operation. The advantage of this approach is that it is easy to add language constructs and operations independently of each other. © 2013 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Koopman, P. (2013). Functional semantics. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8106, pp. 60–78). Springer Verlag. https://doi.org/10.1007/978-3-642-40355-2_6
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
