A syntactic approach to type soundness
Information and Computation
Kripke logical relations and PCF
Information and Computation
The functional approach to programming
The functional approach to programming
Operational reasoning for functions with local state
Higher order operational techniques in semantics
The Definition of Standard ML
Relational Interpretations of Recursive Types in an operational Setting (Summary)
TACS '97 Proceedings of the Third International Symposium on Theoretical Aspects of Computer Software
Existential Types: Logical Relations and Operational Equivalence
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Reasoning about local variables with operationally-based logical relations
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Towards a Theory of Bisimulation for Local Names
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Parametric polymorphism and operational equivalence
Mathematical Structures in Computer Science
Applied Semantics, International Summer School, APPSEM 2000, Caminha, Portugal, September 9-15, 2000, Advanced Lectures
Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On a monadic semantics for freshness
Theoretical Computer Science - Applied semantics: Selected topics
Observational Semantics for a Concurrent Lambda Calculus with Reference Cells and Futures
Electronic Notes in Theoretical Computer Science (ENTCS)
Rule-Based Operational Semantics for an Imperative Language
Electronic Notes in Theoretical Computer Science (ENTCS)
Safety of nöcker's strictness analysis
Journal of Functional Programming
Verifying distributed systems: the operational approach
Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Operational domain theory and topology of sequential programming languages
Information and Computation
Resolving Inductive Definitions with Binders in Higher-Order Typed Functional Programming
ESOP '09 Proceedings of the 18th European Symposium on Programming Languages and Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Automatic mining of functionally equivalent code fragments via random testing
Proceedings of the eighteenth international symposium on Software testing and analysis
Semantic foundations for typed assembly languages
ACM Transactions on Programming Languages and Systems (TOPLAS)
Closures of may-, should- and must-convergences for contextual equivalence
Information Processing Letters
Local variable scoping and kleene algebra with tests
RelMiCS'06/AKA'06 Proceedings of the 9th international conference on Relational Methods in Computer Science, and 4th international conference on Applications of Kleene Algebra
Relational semantics for higher-order programs
MPC'06 Proceedings of the 8th international conference on Mathematics of Program Construction
Encoding Abstract Syntax Without Fresh Names
Journal of Automated Reasoning
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
Taming non-compositionality using new binders
UC'07 Proceedings of the 6th international conference on Unconventional Computation
| Hi-index | 0.00 |
This tutorial paper discusses a particular style of operational semantics that enables one to give a 'syntax-directed' inductive definition of termination which is very useful for reasoning about operational equivalence of programs. We restrict attention to contextual equivalence of expressions in the ML family of programming languages, concentrating on functions involving local state. A brief tour of structural operational semantics culminates in a structural definition of termination via an abstract machine using 'frame stacks'. Applications of this to reasoning about contextual equivalence are given.