DeepAI AI Chat
Log In Sign Up

Categorical Semantics of Reversible Pattern-Matching

by   Louis Lemonnier, et al.

This paper is concerned with categorical structures for reversible computation. In particular, we focus on a typed, functional reversible language based on Theseus. We discuss how join inverse rig categories do not in general capture pattern-matching, the core construct Theseus uses to enforce reversibility. We then derive a categorical structure to add to join inverse rig categories in order to capture pattern-matching. We show how such a structure makes an adequate model for reversible pattern-matching.


page 1

page 2

page 3

page 4


Join inverse rig categories for reversible functional programming, and beyond

Reversible computing is a computational paradigm in which computations a...

A categorical foundation for structured reversible flowchart languages: Soundness and adequacy

Structured reversible flowchart languages is a class of imperative rever...

Splitting recursion schemes into reversible and classical interacting threads

Given a simple recursive function, we show how to extract from it a reve...

Unsupervised Learning through Prediction in a Model of Cortex

We propose a primitive called PJOIN, for "predictive join," which combin...

Reversible effects as inverse arrows

Reversible computing models settings in which all processes can be rever...

Structural Equivalences for Reversible Calculi of Communicating Systems (Oral communication)

The formalization of process algebras usually starts with a minimal core...

Inversion, Iteration, and the Art of Dual Wielding

The humble † ("dagger") is used to denote two different operations in ca...