Λ-symsym: An interactive tool for playing with involutions and types

We present the web portal Λ-symsym, available at http://158.110.146.197:31780/automata/, for experimenting with game semantics of λ!-calculus, and its normalizing elementary sub-calculus, the λEAL-calculus. The λ!-calculus is a generalization of the λ-calculus obtained by introducing a modal operator !, giving rise to a pattern β-reduction. Its sub-calculus corresponds to an applicatively closed class of terms normalizing in an elementary number of steps, in which all elementary functions can be encoded. The game model which we consider is the Geometry of Interaction model I introduced by Abramsky to study reversible computations, consisting of partial involutions over a very simple language of moves. Given a λ!- or a λEAL-term, M, Λ-symsym provides: an abstraction algorithm A!, for compiling M into a term, A!(M), of the linear combinatory logic CL!, or the normalizing combinatory logic CLEAL; an interpretation algorithm [[ ]]I yielding a specification of the partial involution [[A!(M)]]I in the model I; an algorithm, I2T, for synthesizing from [[A!(M)]]I a type, I2T ([[A!(M)]]I), in a multimodal, intersection type assignment discipline, Ͱ!. an algorithm, T 2I, for synthesizing a specification of a partial involution from a type in Ͱ!, which is an inverse to the former. We conjecture that Ͱ! M : I2T ([[A!(M)]]I). Λ-symsym permits to investigate experimentally the fine structure of I, and hence the game semantics of the λ!- and λEAL-calculi. For instance, we can easily verify that the model I is a λ!-algebra in the case of strictly linear λ-terms, by checking all the necessary equations, and find counterexamples in the general case. We make this tool available for readers interested to play with games (-semantics). The paper builds on earlier work by the authors, the type system being an improvement.