Cover Image

Reversible Computation with Stacks and "Reversible Management of Failures"

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Palazzo, Matteo, Roversi, Luca
Format:	Preprint
Published:	2025
Subjects:	Programming Languages Computational Complexity Logic in Computer Science
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Towards a Characterization of Two-way Bijections in a Reversible Computational Model
by: Palazzo, Matteo, et al.
Published: (2025)

Algorithmically Expressive, Always-Terminating Model for Reversible Computation
by: Palazzo, Matteo, et al.
Published: (2024)

Kleene algebra with commutativity conditions is undecidable
by: de Amorim, Arthur Azevedo, et al.
Published: (2024)

Reasonable Space for the $λ$-Calculus, Logarithmically
by: Accattoli, Beniamino, et al.
Published: (2022)

LFPL: Revisited and Mechanized
by: Glover, Nathaniel, et al.
Published: (2026)

Complete and tractable machine-independent characterizations of second-order polytime
by: Hainry, Emmanuel, et al.
Published: (2022)

Program Synthesis is $Σ_3^0$-Complete
by: Kim, Jinwoo
Published: (2024)

The Power of Negation in Higher-Order Datalog
by: Charalambidis, Angelos, et al.
Published: (2025)

From Time to Space: The Impact of Linearity in Higher-Order Datalog
by: Charalambidis, Angelos, et al.
Published: (2026)

Flexible Type-Based Resource Estimation in Quantum Circuit Description Languages
by: Colledan, Andrea, et al.
Published: (2024)

Cyclic Proofs in Hoare Logic and its Reverse
by: Brotherston, James, et al.
Published: (2025)

revTPL: The Reversible Temporal Process Language
by: Bocchi, Laura, et al.
Published: (2022)

Counting and Sampling Traces in Regular Languages
by: de Colnet, Alexis, et al.
Published: (2025)

Cypher is Turing-Complete: A Formal Proof via 2-Counter Machine Simulation
by: Halftermeyer, Pierre
Published: (2026)

A faster FPRAS for #NFA
by: Meel, Kuldeep S., et al.
Published: (2023)

Meta-Mathematics of Computational Complexity Theory
by: Oliveira, Igor C.
Published: (2025)

Verifying an Effect-Handler-Based Define-By-Run Reverse-Mode AD Library
by: de Vilhena, Paulo Emílio, et al.
Published: (2021)

Termination of Rewriting on Reversible Boolean Circuits as a Free 3-Category Problem
by: Barile, Adriano, et al.
Published: (2024)

A Reversible Semantics for Janus
by: Lanese, Ivan, et al.
Published: (2026)

Non-commutative linear logic fragments with sub-context-free complexity
by: Nishimiya, Yusaku, et al.
Published: (2025)

The Semantics of Effects: Centrality, Quantum Control and Reversible Recursion
by: Lemonnier, Louis
Published: (2024)

Logic and Computation through the Lens of Semirings
by: Barlag, Timon, et al.
Published: (2025)

Specification and Automatic Verification of Computational Reductions
by: Grange, Julien, et al.
Published: (2024)

The Proof Analysis Problem
by: Arteche, Noel, et al.
Published: (2025)

Effective Versions of Strong Measure Zero
by: Rayman, Matthew
Published: (2025)

On the consistency of stronger lower bounds for NEXP
by: Thapen, Neil
Published: (2025)

Functional variant of Polynomial Analogue of Gandy's Fixed Point Theorem
by: Nechesov, Andrey
Published: (2024)

Proof Complexity of Linear Logics
by: Tabatabai, Amirhossein Akbar, et al.
Published: (2026)

An order out of nowhere: a new algorithm for infinite-domain CSPs
by: Mottet, Antoine, et al.
Published: (2023)

Proof complexity of positive branching programs
by: Das, Anupam, et al.
Published: (2021)

Parallelism and Adaptivity in Student-Teacher Witnessing
by: Ježil, Ondřej, et al.
Published: (2026)

The complete classification for quantified equality constraints
by: Zhuk, Dmitriy, et al.
Published: (2021)

Feasibly Constructive Proof of Schwartz-Zippel Lemma and the Complexity of Finding Hitting Sets
by: Atserias, Albert, et al.
Published: (2024)

$Π_{2}^{P}$ vs PSpace Dichotomy for the Quantified Constraint Satisfaction Problem
by: Zhuk, Dmitriy
Published: (2024)

Proto-Quipper with Reversing and Control
by: Fu, Peng, et al.
Published: (2024)

The Expressive Power of Transformers with Chain of Thought
by: Merrill, William, et al.
Published: (2023)

2-ASP(Q) programs with weak constraints: Complexity and efficient implementation
by: Cuteri, Andrea, et al.
Published: (2026)

Complexity of Consistency Testing for the Release-Acquire Semantics
by: Govind, R., et al.
Published: (2026)

Crash-Stop Failures in Asynchronous Multiparty Session Types
by: Barwell, Adam D., et al.
Published: (2023)

A Framework for Universality in Physics, Computer Science, and Beyond
by: Gonda, Tomáš, et al.
Published: (2023)