4th Annual Symposium on Theoretical Aspects of Computer Sciences on STACS 87
From operational semantics to abstract machines: preliminary results
LFP '90 Proceedings of the 1990 ACM conference on LISP and functional programming
Logic programming in the LF logical framework
Logical frameworks
A framework for defining logics
Journal of the ACM (JACM)
Inductive definitions, semantics and abstract interpretations
POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Information and Computation
Constructive design of a hierarchy of semantics of a transition system by abstract interpretation
Theoretical Computer Science
Algorithms for Equality and Unification in the Presence of Notational Definitions
TYPES '98 Selected papers from the International Workshop on Types for Proofs and Programs
System Description: Twelf - A Meta-Logical Framework for Deductive Systems
CADE-16 Proceedings of the 16th International Conference on Automated Deduction: Automated Deduction
A temporal-logic approach to binding-time analysis
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Definitional interpreters for higher-order programming languages
ACM '72 Proceedings of the ACM annual conference - Volume 2
A functional correspondence between evaluators and abstract machines
Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming
Higher-order rewriting with dependent types (lambda calculus)
Higher-order rewriting with dependent types (lambda calculus)
A functional correspondence between call-by-need evaluators and lazy abstract machines
Information Processing Letters
Theoretical Computer Science - Applied semantics: Selected topics
A syntactic correspondence between context-sensitive calculi and abstract machines
Theoretical Computer Science
Mechanizing metatheory in a logical framework
Journal of Functional Programming
Defunctionalized interpreters for programming languages
Proceedings of the 13th ACM SIGPLAN international conference on Functional programming
Celf --- A Logical Framework for Deductive and Concurrent Systems (System Description)
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Coinductive big-step operational semantics
Information and Computation
Substructural Operational Semantics as Ordered Logic Programming
LICS '09 Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer Science
Trace-Based Coinductive Operational Semantics for While
TPHOLs '09 Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics
Semantics Engineering with PLT Redex
Semantics Engineering with PLT Redex
Proceedings of the 15th ACM SIGPLAN international conference on Functional programming
Proceedings of the 20th ACM SIGPLAN workshop on Partial evaluation and program manipulation
TFP'10 Proceedings of the 11th international conference on Trends in functional programming
A correspondence between type checking via reduction and type checking via evaluation
Information Processing Letters
From natural semantics to abstract machines
LOPSTR'04 Proceedings of the 14th international conference on Logic Based Program Synthesis and Transformation
Theoretical Computer Science
Logical approximation for program analysis
Higher-Order and Symbolic Computation
Classical call-by-need sequent calculi: the unity of semantic artifacts
FLOPS'12 Proceedings of the 11th international conference on Functional and Logic Programming
Operational semantics using the partiality monad
Proceedings of the 17th ACM SIGPLAN international conference on Functional programming
Practical Foundations for Programming Languages
Practical Foundations for Programming Languages
ESOP'13 Proceedings of the 22nd European conference on Programming Languages and Systems
Substructural logical specifications
Substructural logical specifications
| Hi-index | 0.00 |
We present a logical correspondence between natural semantics and abstract machines. This correspondence enables the mechanical and fully-correct construction of an abstract machine from a natural semantics. Our logical correspondence mirrors the Reynolds functional correspondence, but we manipulate semantic specifications encoded in a logical framework instead of manipulating functional programs. Natural semantics and abstract machines are instances of substructural operational semantics. As a byproduct, using a substructural logical framework, we bring concurrent and stateful models into the domain of the logical correspondence.