Program equivalence in a simple language with state
DOI10.1016/J.CL.2012.02.002zbMATH Open1248.68155OpenAlexW2067169385MaRDI QIDQ456473FDOQ456473
Publication date: 25 October 2012
Published in: Computer Languages, Systems \& Structures (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cl.2012.02.002
Recommendations
- The impact of higher-order state and control effects on local relational reasoning
- The impact of higher-order state and control effects on local relational reasoning
- Operational reasoning for functions with local state
- Relational Semantics for Higher-Order Programs
- Program equivalence in linear contexts
game semanticslogical relationsenvironmental bisimulationshigher-order computation and local statenominal computationprogram equivalence
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- On full abstraction for PCF: I, II and III
- Full abstraction for PCF
- Title not available (Why is that?)
- The impact of higher-order state and control effects on local relational reasoning
- State-dependent representation independence
- A new approach to abstract syntax with variable binding
- Notions of computation and monads
- From Applicative to Environmental Bisimulation
- The \(\pi\)-calculus: A theory of mobile processes
- Introduction to Categories and Categorical Logic
- Game-theoretic analysis of call-by-value computation
- A game semantics of names and pointers
- Operational reasoning for functions with local state
- Algorithmic Nominal Game Semantics
- Full abstraction for nominal general references
- Full Abstraction for Reduced ML
- Foundations of Software Science and Computation Structures
- Game Semantics for Higher-Order Concurrency
- Intensional interpretations of functionals of finite type I
- Finitary PCF is not decidable
- Realisability semantics of parametric polymorphism, general references and recursive types
- A bisimulation for type abstraction and recursion
- Small bisimulations for reasoning about higher-order imperative programs
- Programming Languages and Systems
- A theory of bisimulation for a fragment of concurrent ML with local names
- Kripke logical relations and PCF
- Title not available (Why is that?)
- A Fragment of ML Decidable by Visibly Pushdown Automata
- Title not available (Why is that?)
- Logical relations for monadic types
- Finite state machines for strings over infinite alphabets
- Computer Science Logic
- Fresh-register automata
- Untyped lambda-calculus with input-output
- A bisimulation for dynamic sealing
Cited In (3)
This page was built for publication: Program equivalence in a simple language with state
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q456473)
