Toward a curry-Howard equivalence for linear, reversible computation. Work-in-progress

DOI10.1007/978-3-030-52482-1_8MaRDI QIDQ2039895zbMATH OpenOpenAlexFDO

Authors Kostia Chardonnet, Alexis Saurin, Benoît Valiron

Publication date 5 July 2021

Full work available at URL https://doi.org/10.1007/978-3-030-52482-1_8

zbMATH Keywords

curry-Howardlinear logicreversible computation

Mathematics Subject Classification ID

Other nonclassical models of computation (68Q09) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68)

Cited in

(2)

• Categorical semantics of reversible pattern-matching
• A quick overview on the quantum control approach to the lambda calculus

This page was built for publication: Toward a curry-Howard equivalence for linear, reversible computation. Work-in-progress

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2039895)