A complete, co-inductive syntactic theory of sequential control and state
From MaRDI portal
Publication:3189795
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) 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)
Recommendations
- A Complete, Co-inductive Syntactic Theory of Sequential Control and State
- A syntactic theory of sequential control
- A syntactic theory of sequential state
- The revised report on the syntactic theories of sequential control and state
- A general framework for sequential grammars with control mechanisms
- scientific article; zbMATH DE number 3976319
- Relations between Control Mechanisms for Sequential Grammars1
- Fully abstract semantics for observably sequential languages
- scientific article; zbMATH DE number 3956467
- scientific article; zbMATH DE number 2090723
Cited in
(12)- On the observational theory of the CPS-calculus
- Applicative bisimilarities for call-by-name and call-by-value \(\lambda\mu\)-calculus
- Complete trace models of state and control
- Bisimulations for delimited-control operators
- Proving soundness of extensional normal-form bisimilarities
- scientific article; zbMATH DE number 2064223 (Why is no real title available?)
- A syntactic theory of sequential control
- The revised report on the syntactic theories of sequential control and state
- A syntactic theory of sequential state
- A Complete, Co-inductive Syntactic Theory of Sequential Control and State
- Program equivalence is coinductive
- 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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3189795)