Deciding contextual equivalence of -calculus with effectful contexts

DOI10.1007/978-3-031-30829-1_2MaRDI QIDQ6091179zbMATH OpenOpenAlexFDO

Authors Daniel Hirschkoff, Guilhem Jaber, Enguerrand Prebet

Publication date 24 November 2023

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/978-3-031-30829-1_2

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

Cites work

• A Complete, Co-inductive Syntactic Theory of Sequential Control and State
• A curry-style semantics of interaction: from untyped to second-order lazy -calculus
• A Fully Abstract Trace Semantics for General References
• A new approach to abstract syntax with variable binding
• Algorithmic games for full ground references
• Algorithmic nominal game semantics
• Complete trace models of state and control
• Full abstraction for nominal general references
• Full abstraction for Reduced ML
• scientific article; zbMATH DE number 1324438 (Why is no real title available?)
• Linear logic
• On a monadic semantics for freshness
• On the bisimulation proof method
• Program equivalence in a simple language with state
• Sequentiality and the CPS semantics of fresh names
• Typed Lambda Calculi and Applications
• Typed Normal Form Bisimulation

Cited in

(3)

• Coeffects: a calculus of context-dependent computation
• scientific article; zbMATH DE number 1954375 (Why is no real title available?)
• Contextual equivalence for state and control via nested data

This page was built for publication: Deciding contextual equivalence of \(\nu \)-calculus with effectful contexts

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6091179)