A complete, co-inductive syntactic theory of sequential control and state

DOI10.1145/1190216.1190244zbMath1295.68093OpenAlexW4230665378WikidataQ130981166 ScholiaQ130981166MaRDI QIDQ3189795

Søren B. Lassen, Kristian Støvring

Publication date: 12 September 2014

Published in: Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1190216.1190244

zbMATH Keywords

bisimulationcontinuationsmutable references

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (7)

Applicative bisimilarities for call-by-name and call-by-value \(\lambda\mu\)-calculus ⋮ Proving soundness of extensional normal-form bisimilarities ⋮ A Complete, Co-inductive Syntactic Theory of Sequential Control and State ⋮ Complete trace models of state and control ⋮ On the observational theory of the CPS-calculus ⋮ Unnamed Item ⋮ A Complete Characterization of Observational Equivalence in Polymorphic λ-Calculus with General References

This page was built for publication: A complete, co-inductive syntactic theory of sequential control and state