LRL

This article is not detailed enough and needs to be expanded. Please help us by adding some more information.

LRL (Lazy Reversible Language) is a reversible progrmming language invented by User:ChuckEsoteric08.

Commands

LRL operates on an infinite number of unbounded registers

Commands	Opreation
INC(x)	increment register x
DEC(x)	decrement register x
GOTO(x)	goto 0-indexed command x. That line should start with (y) where y is line where GOTO command was(counting starts at 1). You can't jump to the same line the GOTO command was. There cannot be multiple GOTO commands which jump to the same line

Computational class

Unknown but If GOTO(x) was conditional command(goto if register is zero) it would be Turing-complete becasue

DEC(r)
GOTO(z)

can simulate Minsky machine instruction JZDEC(r,z)