The fixed point problem of a simple reversible language

DOI10.1016/J.TCS.2019.10.005MaRDI QIDQ1989327zbMATH OpenOpenAlexWikidataFDO

Authors Armando B. Matos, Luca Paolini, Luca Roversi

Publication date 21 April 2020

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/2318/1734164

zbMATH Keywords

decidabilityfixed pointsreversible computing

Mathematics Subject Classification ID

Logic in computer science (03B70) Theory of programming languages (68N15) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Other nonclassical models of computation (68Q09)

Recommendations

• Linear programs in a simple reversible language.
• Towards a reversible functional language
• Reversible Flowchart Languages and the Structured Reversible Program Theorem
• Fundamentals of reversible flowchart languages
• What do reversible programs compute?

Cites work

• \textsc{qPCF}: a language for quantum circuit computations
• A certified study of a reversible programming language
• A class of reversible primitive recursive functions
• Computability and Logic
• scientific article; zbMATH DE number 5778850 (Why is no real title available?)
• scientific article; zbMATH DE number 3692653 (Why is no real title available?)
• scientific article; zbMATH DE number 3700811 (Why is no real title available?)
• scientific article; zbMATH DE number 42574 (Why is no real title available?)
• scientific article; zbMATH DE number 1339873 (Why is no real title available?)
• scientific article; zbMATH DE number 1955470 (Why is no real title available?)
• scientific article; zbMATH DE number 914352 (Why is no real title available?)
• scientific article; zbMATH DE number 3286027 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• scientific article; zbMATH DE number 3073037 (Why is no real title available?)
• Linear programs in a simple reversible language.
• Notes on Landauer's principle, reversible computation, and Maxwell's demon
• On reversible Turing machines and their function universality
• On the computational complexity of imperative programming languages
• On the expressive power of the loop language
• On the Number of Solutions of Diophantine Equations
• Quantum programming made easy
• Remarks on blind and partially blind one-way multicounter machines
• Reversible Computing
• System NEL is undecidable
• Theory of reversible computing
• Turing computability. Theory and applications
• Undecidable diophantine equations
• Universality of a reversible two-counter machine
• What do reversible programs compute?

Cited in

(5)

• Linear programs in a simple reversible language.
• Certifying algorithms and relevant properties of reversible primitive permutations with \textsf{Lean}
• Splitting Recursion Schemes into Reversible and Classical Interacting Threads
• Certifying expressive power and algorithms of reversible primitive permutations with \textsf{Lean}
• Mixed quantifier prefixes over Diophantine equations with integer variables

Describes a project that uses

Uses Software

• qPCF

This page was built for publication: The fixed point problem of a simple reversible language

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