A Certified Study of a Reversible Programming Language
DOI10.4230/LIPICS.TYPES.2015.7zbMATH Open1433.68080OpenAlexW2623394745MaRDI QIDQ4580228FDOQ4580228
Mauro Piccolo, Luca Paolini, Luca Roversi
Publication date: 13 August 2018
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2018/8477/pdf/LIPIcs-TYPES-2015-7.pdf/
Theory of programming languages (68N15) Categorical semantics of formal languages (18C50) Semantics in the theory of computing (68Q55) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)
Cites Work
- The Matita Interactive Theorem Prover
- On quantum lambda calculi: a foundational perspective
- A Survey of Graphical Languages for Monoidal Categories
- Reversible Flowchart Languages and the Structured Reversible Program Theorem
- Logical Reversibility of Computation
- Title not available (Why is that?)
- What Do Reversible Programs Compute?
- Reversible Machine Code and Its Abstract Processor Architecture
- Title not available (Why is that?)
- Some Domain Theory and Denotational Semantics in Coq
- A class of reversible primitive recursive functions
- Isomorphic Interpreters from Logically Reversible Abstract Machines
Cited In (6)
- A class of recursive permutations which is primitive recursive complete
- The fixed point problem of a simple reversible language
- From reversible programming languages to reversible metalanguages
- A type-assignment of linear erasure and duplication
- Reversible Programs Have Reversible Semantics
- Certifying algorithms and relevant properties of reversible primitive permutations with \textsf{Lean}
Uses Software
This page was built for publication: A Certified Study of a Reversible Programming Language
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4580228)
