Certifying expressive power and algorithms of reversible primitive permutations with Lean
Reversible primitive permutations (RPP) is a class of recursive functions that models reversible computation. We present a proof, which has been verified using the proof-assistant Lean, that demonstrates RPP can encode every primitive recursive function (PRF-completeness) and that each RPP can be en...
Saved in:
Published in | Journal of logical and algebraic methods in programming Vol. 136; p. 100923 |
---|---|
Main Authors | , |
Format | Journal Article |
Language | English |
Published |
Elsevier Inc
01.01.2024
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Be the first to leave a comment!