Chronological Overview 
 Type-Hierarchical Overview 
Formal Methods in Computing
(Most of the papers antecedent to 1995
are not included in the list)
FRAMES  NO FRAME 

matos2020lncs (In proceedings)
Author(s) Armando B. Matos, Luca Paolini and Luca Roversi
Title« On the Expressivity of Total Reversible Programming Languages »
InReversible Computation
Editor(s) Ivan Lanese and Mariusz Rawski
Page(s)128--143
Year2020
PublisherSpringer International Publishing
AddressCham
ISBN number978-3-030-52482-1
Abstract
SRL is a reversible programming language conceived as a restriction of imperative programming languages. Each SRL program that mentions n registers defines a bijection on n-tuples of integers. Despite its simplicity, SRL is strong enough to grasp a wide class of computable bijections and to rise non-trivial programming issues. We advance in the study of its expressivity. We show how to choose among alternative program-branches by checking if a given value is positive or negative. So, we answer some longstanding questions that the literature poses. In particular, we prove that SRL is primitive recursive complete and that its program equivalence is undecidable.

BibTeX code

@inproceedings{matos2020lncs,
  author = {Matos, Armando B. and Paolini, Luca and Roversi, Luca},
  booktitle = {Reversible Computation},
  editor = {Lanese, Ivan and Rawski, Mariusz},
  isbn = {978-3-030-52482-1},
  abstract = {SRL is a reversible programming language conceived as a
              restriction of imperative programming languages. Each SRL program
              that mentions n registers defines a bijection on n-tuples of
              integers. Despite its simplicity, SRL is strong enough to grasp a
              wide class of computable bijections and to rise non-trivial
              programming issues. We advance in the study of its expressivity.
              We show how to choose among alternative program-branches by
              checking if a given value is positive or negative. So, we answer
              some longstanding questions that the literature poses. In
              particular, we prove that SRL is primitive recursive complete and
              that its program equivalence is undecidable.},
  title = {On the Expressivity of Total Reversible Programming Languages},
  address = {Cham},
  publisher = {Springer International Publishing},
  year = {2020},
  pages = {128--143},
}


 Chronological Overview 
 Type-Hierarchical Overview 
Formal Methods in Computing
(Most of the papers antecedent to 1995
are not included in the list)
FRAMES  NO FRAME 

This document was generated by bib2html 3.3.
(Modified by Luca Paolini, under the GNU General Public License)

Valid HTML 4.01!