A basic abstract semantic algebra
Proc. of the international symposium on Semantics of data types
Unified algebras and action semantics
Proceedings of the 6th Annual Symposium on Theoretical Aspects of Computer Science on STACS 89
Handbook of theoretical computer science (vol. B)
Handbook of theoretical computer science (vol. B)
Two-level functional languages
Two-level functional languages
Action semantics
Extraction of strong typing laws from action semantics definitions
ESOP'92 Symposium proceedings on 4th European symposium on programming
Partial evaluation and automatic program generation
Partial evaluation and automatic program generation
Action transformation by partial evaluation
PEPM '95 Proceedings of the 1995 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Algebraic Semantics
Composing programming languages by combining action-semantics modules
Science of Computer Programming - Special issue: Language descriptions, tools and applications (LDTA'01)
An Action Semantics of Standard ML
Proceedings of the 3rd Workshop on Mathematical Foundations of Programming Language Semantics
Theory and Practice of Action Semantics
MFCS '96 Proceedings of the 21st International Symposium on Mathematical Foundations of Computer Science
A Semantic Algebra for Binding Constructs
Proceedings of the International Colloquium on Formalization of Programming Concepts
| Hi-index | 0.00 |
We propose a naive version of action semantics that begins with a selection of "transient" and "persistent" facets, each characterized as a partial monoid. Yielders are defined as operations on the monoids' values, and actions extract values from the facets, give them to yielders, and place the results into facet output. Actions are composed with a primary combinator, andthen, which can be specialized for multiple facet flows, and the choice combinator, or. Using big-step-style deduction rules, we give the semantics of yielders and actions, and we introduce a weakening rule and a strengthening rule, which let us compose actions with different facet domain-codomains. We also introduce Mosses abstraction, a lambda-abstraction variant that improves the readability of action-semantics definitions. Finally, we exploit the subsort (subtype) structure within Mosses's unified algebras to use the deduction rules as both a typing definition as well as a semantics definition. Partial evaluation techniques are applied to type check and compile programs.