| Janus | |
| Year: | 1982, 2007 |
| Designer: | Christopher Lutz, Howard Derby, Tetsuo Yokoyama, and Robert Glück |
| Implementations: | Janus Playground |
Janus is a time-reversible programming language written at Caltech in 1982.[1] The operational semantics of the language were formally specified, together with a program inverter and an invertible self-interpreter, in 2007 by Tetsuo Yokoyama and Robert Glück.[2] [3] A Janus inverter and interpreter is made freely available by the TOPPS research group at DIKU.[4] Another Janus interpreter was implemented in Prolog in 2009.[5] An optimizing compiler has been developed in the RC3 research group.[6] [7] The below summarises the language presented in the 2007 paper.
Janus is a structured imperative programming language that operates on a global store without heap allocation and does not support dynamic data structures. As a reversible programming language, Janus performs deterministic computations in both forward and backward directions. An extension of Janus features procedure parameters and local variable declarations (local-delocal). Additionally, other variants of Janus support dynamic data structures such as lists.[8] [9]
We specify the syntax of Janus using Backus–Naur form.
A Janus program is a sequence of one or more variable declarations, followed by a sequence of one or more procedure declarations:
Note, Janus as specified in the 2007 paper,[2] allows zero or more variables, but a program that starts with an empty store, produces an empty store. A program that does nothing is trivially invertible, and not interesting in practice.
A variable declaration defines either a variable or a one-dimensional array:
Note, variable declarations carry no type information. This is because all values (and all constants) in Janus are non-negative 32-bit integers, so all values are between 0 and 232 − 1 = 4294967295. Note however, that the Janus interpreter hosted by TOPPS uses regular two's complement 32-bit integers, so all values there are between −231 = −2147483648 and 231 − 1 = 2147483647. All variables are initialized to the value 0.
There are no theoretical bounds to the sizes of arrays, but the said interpreter demands a size of at least 1.[4]
A procedure declaration consists of the keyword procedure, followed by a unique procedure identifier and a statement:
The entry point of a Janus program is a procedure named main. If no such procedure exists, the last procedure in the program text is the entry point.
A statement is either an assignment, a swap, an if-then-else, a loop, a procedure call, a procedure uncall, a skip, or a sequence of statements:
:= "else" "fi" "loop" "until"
For assignments to be reversible, it is demanded that the variable on the left-hand side does not appear in the expressions on either side of the assignment. (Note, array cell assignment has an expression on both sides of the assignment.)
A swap (<x> "<=>" <x>) is trivially reversible.
For conditionals to be reversible, we provide both a test (the <e> after "if") and an assertion (the <e> after "fi"). The semantics is that the test must hold before the execution of the then-branch, and the assertion must hold after it. Conversely, the test must not hold before the execution of the else-branch, and the assertion must not hold after it. In the inverted program, the assertion becomes the test, and the test becomes the assertion. (Since all values in Janus are integers, the usual C-semantics that 0 indicates false are employed.)
For loops to be reversible, we similarly provide an assertion (the <e> after "from") and a test (the <e> after "until"). The semantics is that the assertion must hold only on entry to the loop, and the test must hold only on exit from the loop. In the inverted program, the assertion becomes the test, and the test becomes the assertion. An additional <e> after "loop" allows to perform work after the test is evaluated to false. The work should ensure that the assertion is false subsequently.
A procedure call executes the statements of a procedure in a forward direction. A procedure uncall executes the statements of a procedure in the backward direction. There are no parameters to procedures, so all variable passing is done by side-effects on the global store.
An expression is a constant (integer), a variable, an indexed variable, or an application of a binary operation:
The constants in Janus (and the Janus interpreter hosted by TOPPS) have already been discussed above.
A binary operator is one of the following, having semantics similar to their C counterparts:
The modification operators are a subset of the binary operators such that for all v,
λv'. ⊕ \left(v',v\right)
⊕
The inverse functions are "-", "+", and "^", respectively.
The restriction that the variable assigned to does not appear in an expression on either side of the assignment allows us to prove that the inference system of Janus is forward and backward deterministic.
The language Janus was initially conceived at Caltech in 1982. Subsequent work formalized the language semantics in the form of natural semantics and the denotational semantics.[10] The semantics of purely reversible programming languages can also be treated reversibly at the meta level.
We write a Janus procedure fib to find the n-th Fibonacci number, for n>2, i=n, x1=1, and x2=1:
procedure fib
from i = n
do
x1 += x2
x1 <=> x2
i -= 1
until i = 2
Upon termination, x1 is the (n−1)-th Fibonacci number and x2 is the nth Fibonacci number. i is an iterator variable that goes from to 2. As i is decremented in every iteration, the assumption (i = n) is only true prior to the first iteration. The test is (i = 2) is only true after the last iteration of the loop (assuming > 2).
Assuming the following prelude to the procedure, we end up with the 4th Fibonacci number in x2:
i n x1 x2
procedure main
n += 4
i += n
x1 += 1
x2 += 1
call fib
Note, our main would have to do a bit more work if we were to make it handle n≤2, especially negative integers.
The inverse of fib is:
procedure fib
from i = 2
do
i += 1
x1 <=> x2
x1 -= x2
loop
until i = n
As you can see, Janus programs can be transformed by local inversion, where the loop test and assertion are swapped, the order of statements is reversed, and every statement in the loop is itself reversed. The inverse program can be used to find when is the (n-1)th and is the nth Fibonacci number.