Denotational semantics: a methodology for language development
Denotational semantics: a methodology for language development
On the algebraic definition of programming languages
ACM Transactions on Programming Languages and Systems (TOPLAS)
4th Annual Symposium on Theoretical Aspects of Computer Sciences on STACS 87
PLDI '88 Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation
SDE 3 Proceedings of the third ACM SIGSOFT/SIGPLAN software engineering symposium on Practical software development environments
Unified algebras and action semantics
Proceedings of the 6th Annual Symposium on Theoretical Aspects of Computer Science on STACS 89
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The gamma model and its discipline of programming
Science of Computer Programming
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
A framework for defining logics
Journal of the ACM (JACM)
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
Reasoning about programs in continuation-passing style
Lisp and Symbolic Computation - Special issue on continuations—part I
Monad transformers and modular interpreters
POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Evolving algebras 1993: Lipari guide
Specification and validation methods
Essentials of programming languages (2nd ed.)
Essentials of programming languages (2nd ed.)
Types and programming languages
Types and programming languages
Formal Syntax and Semantics of Programming Languages: A Laboratory Based Approach
Formal Syntax and Semantics of Programming Languages: A Laboratory Based Approach
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
Computer-Aided Reasoning: An Approach
Computer-Aided Reasoning: An Approach
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)
Rewriting logic: roadmap and bibliography
Theoretical Computer Science - Rewriting logic and its applications
ELAN from a rewriting logic point of view
Theoretical Computer Science - Rewriting logic and its applications
Maude: specification and programming in rewriting logic
Theoretical Computer Science - Rewriting logic and its applications
Equational rules for rewriting logic
Theoretical Computer Science - Rewriting logic and its applications
Membership algebra as a logical framework for equational specification
WADT '97 Selected papers from the 12th International Workshop on Recent Trends in Algebraic Development Techniques
AMAST '02 Proceedings of the 9th International Conference on Algebraic Methodology and Software Technology
Rewriting Logic as a Semantic Framework for Concurrency: a Progress Report
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Algebraic Denotational Semantics Using Parameterized Abstract Modules
Proceedings of the International Colloquium on Formalization of Programming Concepts
Semantic foundations for generalized rewrite theories
Theoretical Computer Science
The rewriting logic semantics project
Theoretical Computer Science
Deduction, Strategies, and Rewriting
Electronic Notes in Theoretical Computer Science (ENTCS)
Real-time rewriting semantics of orc
Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming
Java+ITP: A Verification Tool Based on Hoare Logic and Algebraic Semantics
Electronic Notes in Theoretical Computer Science (ENTCS)
A Rewriting Semantics for ABEL with Applications to Hardware/Software Co-Design and Analysis
Electronic Notes in Theoretical Computer Science (ENTCS)
Partial Order Reduction for Rewriting Semantics of Programming Languages
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
A Rewrite Framework for Language Definitions and for Generation of Efficient Interpreters
Electronic Notes in Theoretical Computer Science (ENTCS)
Static and dynamic formal analysis of concurrent systems and languages: a semantics-based approach
Static and dynamic formal analysis of concurrent systems and languages: a semantics-based approach
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
Modular Rewriting Semantics in Practice
Electronic Notes in Theoretical Computer Science (ENTCS)
A Run-Time Environment for Concurrent Objects With Asynchronous Method Calls
Electronic Notes in Theoretical Computer Science (ENTCS)
PMaude: Rewrite-based Specification Language for Probabilistic Object Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Rule-based analysis of dimensional safety
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
All about maude - a high-performance logical framework: how to specify, program and verify systems in rewriting logic
Automatic validation of transformation rules for java verification against a rewriting semantics
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Representing and reasoning with operational semantics
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
Proceedings of the 8th international workshop on Specification and verification of component-based systems
Converting between combinatory reduction systems and big step semantics
Semantics and algebraic specification
K-Maude: a rewriting based tool for semantics of programming languages
WRLA'10 Proceedings of the 8th international conference on Rewriting logic and its applications
Collecting semantics under predicate abstraction in the K framework
WRLA'10 Proceedings of the 8th international conference on Rewriting logic and its applications
The rewriting logic semantics project: a progress report
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
An introduction to maude and some of its applications
PADL'10 Proceedings of the 12th international conference on Practical Aspects of Declarative Languages
From linear temporal logic properties to rewrite propositions
IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
WRLA'12 Proceedings of the 9th international conference on Rewriting Logic and Its Applications
Design and analysis of cloud-based architectures with KLAIM and maude
WRLA'12 Proceedings of the 9th international conference on Rewriting Logic and Its Applications
Making maude definitions more interactive
WRLA'12 Proceedings of the 9th international conference on Rewriting Logic and Its Applications
The rewriting logic semantics project: A progress report
Information and Computation
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
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, continuation-based semantics, and the chemical abstract machine. 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.