Expressive Power of One-Shot Control Operators and Coroutines
Fuente:
arXiv
Saved in:
| Main Authors: | Kobayashi, Kentaro, Kameyama, Yukiyoshi |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
On the Expressivity of Typed Concurrent Calculi
by: Paulus, Joseph William Neal
Published: (2024)
by: Paulus, Joseph William Neal
Published: (2024)
Expressivity of AuDaLa: Turing Completeness and Possible Extensions
by: Franken, Tom T. P., et al.
Published: (2024)
by: Franken, Tom T. P., et al.
Published: (2024)
On Decidable and Undecidable Extensions of Simply Typed Lambda Calculus
by: Kobayashi, Naoki
Published: (2024)
by: Kobayashi, Naoki
Published: (2024)
On Higher-Order Reachability Games vs May Reachability
by: Asada, Kazuyuki, et al.
Published: (2022)
by: Asada, Kazuyuki, et al.
Published: (2022)
Abstractions of Sequences, Functions and Operators
by: Rustenholz, Louis, et al.
Published: (2025)
by: Rustenholz, Louis, et al.
Published: (2025)
Theorem Provers: One Size Fits All?
by: Oates, Harrison, et al.
Published: (2025)
by: Oates, Harrison, et al.
Published: (2025)
Abstract Operational Methods for Call-by-Push-Value
by: Goncharov, Sergey, et al.
Published: (2024)
by: Goncharov, Sergey, et al.
Published: (2024)
Foundations of Digital Circuits: Denotation, Operational, and Algebraic Semantics
by: Kaye, George
Published: (2025)
by: Kaye, George
Published: (2025)
Logical Predicates in Higher-Order Mathematical Operational Semantics
by: Goncharov, Sergey, et al.
Published: (2024)
by: Goncharov, Sergey, et al.
Published: (2024)
Complete the Cycle: Reachability Types with Expressive Cyclic References (Extended Version)
by: Deng, Haotian, et al.
Published: (2025)
by: Deng, Haotian, et al.
Published: (2025)
The Functional Machine Calculus III: Control
by: Heijltjes, Willem
Published: (2025)
by: Heijltjes, Willem
Published: (2025)
Structural Analysis of GRAFCET Control Specifications
by: Schnakenbeck, Aron, et al.
Published: (2023)
by: Schnakenbeck, Aron, et al.
Published: (2023)
Formal Analysis of Networked PLC Controllers Interacting with Physical Environments
by: Lee, Jaeseo, et al.
Published: (2025)
by: Lee, Jaeseo, et al.
Published: (2025)
J-P: MDP. FP. PP.: Characterizing Total Expected Rewards in Markov Decision Processes as Least Fixed Points with an Application to Operational Semantics of Probabilistic Programs (Technical Report)
by: Batz, Kevin, et al.
Published: (2024)
by: Batz, Kevin, et al.
Published: (2024)
Regrading Policies for Flexible Information Flow Control in Session-Typed Concurrency
by: Derakhshan, Farzaneh, et al.
Published: (2024)
by: Derakhshan, Farzaneh, et al.
Published: (2024)
Algorithmically Expressive, Always-Terminating Model for Reversible Computation
by: Palazzo, Matteo, et al.
Published: (2024)
by: Palazzo, Matteo, et al.
Published: (2024)
Kleene algebra with commutativity conditions is undecidable
by: de Amorim, Arthur Azevedo, et al.
Published: (2024)
by: de Amorim, Arthur Azevedo, et al.
Published: (2024)
Symbolic Specification and Reasoning for Quantum Data and Operations
by: Ying, Mingsheng
Published: (2025)
by: Ying, Mingsheng
Published: (2025)
Towards a Higher-Order Mathematical Operational Semantics
by: Goncharov, Sergey, et al.
Published: (2022)
by: Goncharov, Sergey, et al.
Published: (2022)
The Expressive Power of Transformers with Chain of Thought
by: Merrill, William, et al.
Published: (2023)
by: Merrill, William, et al.
Published: (2023)
The Power of Negation in Higher-Order Datalog
by: Charalambidis, Angelos, et al.
Published: (2025)
by: Charalambidis, Angelos, et al.
Published: (2025)
A Complete Theory of Sequential Digital Circuits: Denotational, Operational and Algebraic Semantics
by: Ghica, Dan R., et al.
Published: (2022)
by: Ghica, Dan R., et al.
Published: (2022)
Impredicativity in Linear Dependent Type Theory
by: Speight, Sam, et al.
Published: (2026)
by: Speight, Sam, et al.
Published: (2026)
A Probabilistic Choreography Language for PRISM
by: Carbone, Marco, et al.
Published: (2025)
by: Carbone, Marco, et al.
Published: (2025)
Denotational Semantics for Probabilistic and Concurrent Programs
by: Zilberstein, Noam, et al.
Published: (2025)
by: Zilberstein, Noam, et al.
Published: (2025)
Positive Sharing and Abstract Machines
by: Accattoli, Beniamino, et al.
Published: (2025)
by: Accattoli, Beniamino, et al.
Published: (2025)
Verifying Graph Algorithms in Separation Logic: A Case for an Algebraic Approach (Extended Version)
by: Grandury, Marcos, et al.
Published: (2025)
by: Grandury, Marcos, et al.
Published: (2025)
Separating the Wheat from the Chaff: Understanding (In-)Completeness of Proof Mechanisms for Separation Logic with Inductive Definitions
by: Elad, Neta, et al.
Published: (2025)
by: Elad, Neta, et al.
Published: (2025)
Formal Verification of a Token Sale Launchpad: A Compositional Approach in Dafny
by: Ukhanov, Evgeny
Published: (2025)
by: Ukhanov, Evgeny
Published: (2025)
Orthologic Type Systems
by: Guilloud, Simon, et al.
Published: (2025)
by: Guilloud, Simon, et al.
Published: (2025)
Correct Black-Box Monitors for Distributed Deadlock Detection: Formalisation and Implementation (Technical Report)
by: Rowicki, Radosław Jan, et al.
Published: (2025)
by: Rowicki, Radosław Jan, et al.
Published: (2025)
Contextual Refinement of Higher-Order Concurrent Probabilistic Programs (Extended Version)
by: Li, Kwing Hei, et al.
Published: (2025)
by: Li, Kwing Hei, et al.
Published: (2025)
Proceedings Twelfth Workshop on Fixed Points in Computer Science
by: Saurin, Alexis
Published: (2025)
by: Saurin, Alexis
Published: (2025)
A Lazy, Concurrent Convertibility Checker
by: Courant, Nathanaëlle, et al.
Published: (2025)
by: Courant, Nathanaëlle, et al.
Published: (2025)
A Primal-Dual Perspective on Program Verification Algorithms (Extended Version)
by: Tsukada, Takeshi, et al.
Published: (2025)
by: Tsukada, Takeshi, et al.
Published: (2025)
Coinductive Proofs for Temporal Hyperliveness
by: Correnson, Arthur, et al.
Published: (2025)
by: Correnson, Arthur, et al.
Published: (2025)
Constructive characterisations of the must-preorder for asynchrony
by: Bernardi, Giovanni, et al.
Published: (2025)
by: Bernardi, Giovanni, et al.
Published: (2025)
Modular Reasoning about Error Bounds for Concurrent Probabilistic Programs (Extended Version)
by: Li, Kwing Hei, et al.
Published: (2025)
by: Li, Kwing Hei, et al.
Published: (2025)
Extended Abstract: Mutable Objects with Several Implementations
by: Kaufmann, Matt, et al.
Published: (2025)
by: Kaufmann, Matt, et al.
Published: (2025)
Cyclic Proofs in Hoare Logic and its Reverse
by: Brotherston, James, et al.
Published: (2025)
by: Brotherston, James, et al.
Published: (2025)
Similar Items
-
On the Expressivity of Typed Concurrent Calculi
by: Paulus, Joseph William Neal
Published: (2024) -
Expressivity of AuDaLa: Turing Completeness and Possible Extensions
by: Franken, Tom T. P., et al.
Published: (2024) -
On Decidable and Undecidable Extensions of Simply Typed Lambda Calculus
by: Kobayashi, Naoki
Published: (2024) -
On Higher-Order Reachability Games vs May Reachability
by: Asada, Kazuyuki, et al.
Published: (2022) -
Abstractions of Sequences, Functions and Operators
by: Rustenholz, Louis, et al.
Published: (2025)