A Complete, Co-inductive Syntactic Theory of Sequential Control and State
From MaRDI portal
Recommendations
Cites work
- \(\lambda\mu\)-calculus and Böhm's theorem
- A bisimulation for type abstraction and recursion
- A Complete Characterization of Observational Equivalence in Polymorphic λ-Calculus with General References
- A complete, co-inductive syntactic theory of sequential control and state
- A Fully Abstract Trace Semantics for General References
- A theory of bisimulation for the -calculus
- A Theory of Non-monotone Memory (Or: Contexts for free)
- Action Semantics
- Bisimilarity as a theory of functional programming
- Call-by-name, call-by-value and the \(\lambda\)-calculus
- Equivalence in functional languages with effects
- scientific article; zbMATH DE number 2185675 (Why is no real title available?)
- scientific article; zbMATH DE number 92599 (Why is no real title available?)
- scientific article; zbMATH DE number 176159 (Why is no real title available?)
- scientific article; zbMATH DE number 1222571 (Why is no real title available?)
- scientific article; zbMATH DE number 1324438 (Why is no real title available?)
- scientific article; zbMATH DE number 1330448 (Why is no real title available?)
- scientific article; zbMATH DE number 1064116 (Why is no real title available?)
- scientific article; zbMATH DE number 2038761 (Why is no real title available?)
- Normal form simulation for McCarthy's \textsf{amb}
- On the observational theory of the CPS-calculus (extended abstract)
- On the semantics of the call-by-name CPS transform
- Open Bisimulation for Aspects
- Operational reasoning for functions with local state
- Programming Languages and Systems
- Programming Languages and Systems
- Programming languages and systems. 15th European symposium on programming, ESOP 2006, held as part of the joint European conferences on theory and practice of software, ETAPS 2006, Vienna, Austria, March 27--28, 2006. Proceedings.
- Proving congruence of bisimulation in functional programming languages
- Reasoning about functions with effects
- Relational reasoning about contexts
- Revised report on the algorithmic language scheme
- Small bisimulations for reasoning about higher-order imperative programs
- State-dependent representation independence
- The lambda calculus. Its syntax and semantics. Rev. ed.
- The lazy lambda calculus in a concurrency scenario
- The Mechanical Evaluation of Expressions
- The revised report on the syntactic theories of sequential control and state
- Typed Normal Form Bisimulation
Cited in
(12)- A syntactic theory of sequential control
- The revised report on the syntactic theories of sequential control and state
- A syntactic theory of sequential state
- Eager functions as processes
- Normal form simulation for McCarthy's \textsf{amb}
- A sound and complete bisimulation for contextual equivalence in -calculus with call/cc
- A complete, co-inductive syntactic theory of sequential control and state
- scientific article; zbMATH DE number 2064223 (Why is no real title available?)
- Program equivalence is coinductive
- Deciding contextual equivalence of \(\nu \)-calculus with effectful contexts
- (Towards a) statistical probabilistic lazy lambda calculus
- Mirroring call-by-need, or values acting silly
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 Q3184753)
