scientific article; zbMATH DE number 7058777
From MaRDI portal
Publication:5377471
zbMath1421.68012arXiv1804.08373MaRDI QIDQ5377471
Dariusz Biernacki, Piotr Polesiuk, Sergueï Lenglet
Publication date: 24 May 2019
Full work available at URL: https://arxiv.org/abs/1804.08373
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Applicative bisimilarities for call-by-name and call-by-value \(\lambda\mu\)-calculus
- On the expressiveness and decidability of higher-order process calculi
- On the observational theory of the CPS-calculus
- Call-by-name, call-by-value and the \(\lambda\)-calculus
- Fully abstract models of typed \(\lambda\)-calculi
- Full abstraction in the lazy lambda calculus
- Classical logic, storage operators and second-order lambda-calculus
- Bisimilarity as a theory of functional programming
- Proving congruence of bisimulation in functional programming languages
- A proof-theoretic foundation of abortive continuations
- Axioms for control operators in the CPS hierarchy
- A static simulation of dynamic delimited control
- On the static and dynamic extents of delimited continuations
- A Context-based Approach to Proving Termination of Evaluation
- A Systematic Approach to Delimited Control with Multiple Prompts
- Applicative Bisimulations for Delimited-Control Operators
- Normal Form Bisimulations for Delimited-Control Operators
- Backtracking, interleaving, and terminating monad transformers
- Implementing first-class polymorphic delimited continuations by a type-directed selective CPS-transform
- Environmental Bisimulations for Delimited-Control Operators
- The marriage of bisimulations and Kripke logical relations
- Axiomatizing Subtyped Delimited Continuations.
- The impact of higher-order state and control effects on local relational reasoning
- A Sound and Complete Bisimulation for Contextual Equivalence in $$\lambda $$ -Calculus with Call/cc
- Howe’s Method for Calculi with Passivation
- A complete, co-inductive syntactic theory of sequential control and state
- An approach to call-by-name delimited continuations
- Bisimulations Up-to: Beyond First-Order Transition Systems
- Polymorphic Delimited Continuations
- Complete Lattices and Up-To Techniques
- A bisimulation for type abstraction and recursion
- Typed Normal Form Bisimulation
- A Complete Characterization of Observational Equivalence in Polymorphic λ-Calculus with General References
- On the bisimulation proof method
- Parametric polymorphism and operational equivalence
- Coinduction All the Way Up
- A confluent λ-calculus with a catch/throw mechanism
- Subtyping delimited continuations
- Relating models of backtracking
- A sound and complete axiomatization of delimited continuations
- An Operational Foundation for Delimited Continuations in the CPS Hierarchy
- Small bisimulations for reasoning about higher-order imperative programs
- Enhancements of the bisimulation proof method
- A monadic framework for delimited continuations
- THEORETICAL PEARL: A simple proof of a folklore theorem about delimited control
- From Applicative to Environmental Bisimulation
- Untyped lambda-calculus with input-output
- Programming Languages and Systems
- A bisimulation for dynamic sealing
This page was built for publication:
