Cover Image

Algorithmically Expressive, Always-Terminating Model for Reversible Computation

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Palazzo, Matteo, Roversi, Luca
Format:	Preprint
Published:	2024
Subjects:	Programming Languages Logic in Computer Science D.3; F.3
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)

Reversible Computation with Stacks and "Reversible Management of Failures"
by: Palazzo, Matteo, et al.
Published: (2025)

On Modular Termination Proofs of General Logic Programs
by: Bossi, Annalisa, et al.
Published: (2000)

Proving and Computing: The Infinite Pigeonhole Principle and Countable Choice
by: Ariola, Zena M., et al.
Published: (2026)

Fair Termination of Asynchronous Binary Sessions
by: Padovani, Luca, et al.
Published: (2025)

Early Announcement: Parametricity for GADTs
by: Cagne, Pierre, et al.
Published: (2024)

Nominal Algebraic-Coalgebraic Data Types, with Applications to Infinitary Lambda-Calculi
by: Cerda, Rémy
Published: (2025)

Sequence-Based Abstract Interpretation of Prolog
by: Charlier, Baudouin Le, et al.
Published: (2000)

Bisimilarity and Simulatability of Processes Parameterized by Join Interactions
by: Grabmayer, Clemens, et al.
Published: (2025)

Multisets and Distributions
by: Kozen, Dexter, et al.
Published: (2023)

Unified Fairness for Weak Memory Verification
by: Abdulla, Parosh Aziz, et al.
Published: (2023)

The Denotational Semantics of SSA
by: Ghalayini, Jad Elkhaleq, et al.
Published: (2024)

Explicit Weakening
by: Wadler, Philip
Published: (2024)

Definitional Functoriality for Dependent (Sub)Types -- Extended version
by: Laurent, Théo, et al.
Published: (2023)

What does it take to certify a conversion checker?
by: Lennon-Bertrand, Meven
Published: (2025)

Genericity Through Stratification
by: Arrial, Victor, et al.
Published: (2024)

Generically Automating Separation Logic by Functors, Homomorphisms and Modules
by: Xu, Qiyuan, et al.
Published: (2024)

AdapTT: Functoriality for Dependent Type Casts
by: Adjedj, Arthur, et al.
Published: (2025)

Model Checking Probabilistic Operator Precedence Automata
by: Pontiggia, Francesco, et al.
Published: (2024)

Totality for Mixed Inductive and Coinductive Types
by: Hyvernat, Pierre
Published: (2019)

Combining Small-Step and Big-Step Semantics to Verify Loop Optimizations
by: Knothe, David, et al.
Published: (2026)

Transport via Partial Galois Connections and Equivalences
by: Kappelmann, Kevin
Published: (2023)

Probability and Angelic Nondeterminism with Multiset Semantics
by: Ong, Shawn, et al.
Published: (2024)

INTERLEAVE: A Faster Symbolic Algorithm for Maximal End Component Decomposition
by: Bansal, Suguman, et al.
Published: (2025)

Verified VCG and Verified Compiler for Dafny
by: Nezamabadi, Daniel, et al.
Published: (2025)

Reasoning about concurrent loops and recursion with rely-guarantee rules
by: Hayes, Ian J., et al.
Published: (2025)

Effect-Transparent Governance for AI Workflow Architectures: Semantic Preservation, Expressive Minimality, and Decidability Boundaries
by: McCann, Alan L.
Published: (2026)

Extending the Quantitative Pattern-Matching Paradigm
by: Alves, Sandra, et al.
Published: (2024)

Simplifying Safety Proofs with Forward-Backward Reasoning and Prophecy
by: Frenkel, Eden, et al.
Published: (2026)

Linear-Time Graph Programs without Preconditions
by: Alaoui, Ziad Ismaili, et al.
Published: (2025)

A New Interaction Concept for Interactive and Autoactive Program Verification
by: Pfeifer, Wolfram, et al.
Published: (2026)

Modelling Recursion and Probabilistic Choice in Guarded Type Theory
by: Stassen, Philipp Jan Andries, et al.
Published: (2024)

foetus -- Termination Checker for Simple Functional Programs
by: Abel, Andreas
Published: (2024)

Forall-Exists Relational Verification by Filtering to Forall-Forall
by: Nagasamudram, Ramana, et al.
Published: (2025)

Bayesian Separation Logic
by: Ho, Shing Hin, et al.
Published: (2025)

Two-sorted algebraic decompositions of Brookes's shared-state denotational semantics
by: Dvir, Yotam, et al.
Published: (2025)

Guaranteed Bounds on Posterior Distributions of Discrete Probabilistic Programs with Loops
by: Zaiser, Fabian, et al.
Published: (2024)

SMT-based Symbolic Model-Checking for Operator Precedence Languages
by: Chiari, Michele, et al.
Published: (2024)

Intersection Types for a Computational Lambda-Calculus with Global State
by: de'Liguoro, Ugo, et al.
Published: (2021)

The Lambda Calculus is Quantifiable
by: Maestracci, Valentin, et al.
Published: (2024)