4th Annual Symposium on Theoretical Aspects of Computer Sciences on STACS 87
SDE 3 Proceedings of the third ACM SIGSOFT/SIGPLAN software engineering symposium on Practical software development environments
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Notions of computation and monads
Information and Computation
Conditional rewriting logic as a unified model of concurrency
Selected papers of the Second Workshop on Concurrency and compositionality
Selected papers of the Second Workshop on Concurrency and compositionality
The essence of functional programming
POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A syntactic approach to type soundness
Information and Computation
The discoveries of continuations
Lisp and Symbolic Computation - Special issue on continuations—part I
Evolving algebras 1993: Lipari guide
Specification and validation methods
Continuation-Based Program Transformation Strategies
Journal of the ACM (JACM)
Proof, language, and interaction
Essentials of programming languages (2nd ed.)
Essentials of programming languages (2nd ed.)
Types and programming languages
Types and programming languages
Algebraic Semantics of Imperative Programs
Algebraic Semantics of Imperative Programs
Language Prototyping: An Algebraic Specification Approach: Vol. V
Language Prototyping: An Algebraic Specification Approach: Vol. V
The Definition of Standard ML
Java and the Java Virtual Machine: Definition, Verification, Validation with Cdrom
Java and the Java Virtual Machine: Definition, Verification, Validation with Cdrom
Compiling language definitions: the ASF+SDF compiler
ACM Transactions on Programming Languages and Systems (TOPLAS)
Maude: specification and programming in rewriting logic
Theoretical Computer Science - Rewriting logic and its applications
Comparing logics for rewriting: rewriting logic, action calculi and tile logic
Theoretical Computer Science - Rewriting logic and its applications
Mapping tile logic into rewriting logic
WADT '97 Selected papers from the 12th International Workshop on Recent Trends in Algebraic Development Techniques
The rewriting logic semantics project
Theoretical Computer Science
Electronic Notes in Theoretical Computer Science (ENTCS)
Representing and reasoning with operational semantics
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
A Verification Framework for Normative Multi-Agent Systems
PRIMA '08 Proceedings of the 11th Pacific Rim International Conference on Multi-Agents: Intelligent Agents and Multi-Agent Systems
Rewriting Logic Specification of Membrane Systems with Promoters and Inhibitors
Electronic Notes in Theoretical Computer Science (ENTCS)
Using rewrite strategies for testing BUpL agents
LOPSTR'09 Proceedings of the 19th international conference on Logic-Based Program Synthesis and Transformation
| Hi-index | 0.00 |
This paper shows how rewriting logic semantics (RLS) can be used as a computational logic framework for operational semantic definitions of programming languages. Several operational semantics styles are addressed: big-step and small-step structural operational semantics (SOS), modular SOS, reduction semantics with evaluation contexts, and continuation-based semantics. Each of these language definitional styles can be faithfully captured as an RLS theory, in the sense that there is a one-to-one correspondence between computational steps in the original language definition and computational steps in the corresponding RLS theory. A major goal of this paper is to show that RLS does not force or pre-impose any given language definitional style, and that its flexibility and ease of use makes RLS an appealing framework for exploring new definitional styles.