A Complete, Co-inductive Syntactic Theory of Sequential Control and State

DOI10.1007/978-3-642-04164-8_17zbMath1253.68083OpenAlexW2099116867MaRDI QIDQ3184753

Søren B. Lassen, Kristian Støvring

Publication date: 22 October 2009

Published in: Semantics and Algebraic Specification (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-04164-8_17

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Related Items (3)

Eager functions as processes ⋮ A Sound and Complete Bisimulation for Contextual Equivalence in $$\lambda $$ -Calculus with Call/cc ⋮ Deciding contextual equivalence of \(\nu \)-calculus with effectful contexts

Uses Software

• ML

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The lambda calculus. Its syntax and semantics. Rev. ed.
• 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.
• The revised report on the syntactic theories of sequential control and state
• Call-by-name, call-by-value and the \(\lambda\)-calculus
• Revised report on the algorithmic language scheme
• The lazy lambda calculus in a concurrency scenario
• On the semantics of the call-by-name CPS transform
• Bisimilarity as a theory of functional programming
• A theory of bisimulation for the \(\pi\)-calculus
• Proving congruence of bisimulation in functional programming languages
• λμ-calculus and Böhm's theorem
• A complete, co-inductive syntactic theory of sequential control and state
• Typed Normal Form Bisimulation
• A Theory of Non-monotone Memory (Or: Contexts for free)
• Open Bisimulation for Aspects
• A Complete Characterization of Observational Equivalence in Polymorphic λ-Calculus with General References
• Action Semantics
• Equivalence in functional languages with effects
• State-dependent representation independence
• A bisimulation for type abstraction and recursion
• Small bisimulations for reasoning about higher-order imperative programs
• A Fully Abstract Trace Semantics for General References
• The Mechanical Evaluation of Expressions
• Programming Languages and Systems
• Programming Languages and Systems

This page was built for publication: A Complete, Co-inductive Syntactic Theory of Sequential Control and State