Learn More
Girard's <i>Geometry of Interaction (GoI)</i> is interaction based semantics of linear logic proofs and, via suitable translations, of functional programs in general. Its mathematical cleanness identifies essential structures in computation; moreover its use as a compilation technique from programs to state machines---"GoI implementation," so to speak---has(More)
A general framework of Memoryful Geometry of Interaction (mGoI) is introduced recently by the authors. It provides a sound translation of lambda-terms (on the high-level) to their realizations by stream transducers (on the low-level), where the internal states of the latter (called memories) are exploited for accommodating algebraic effects of Plotkin and(More)
In this preliminary report for LOLA 2014, we present a prototype implementation of the memoryful GoI framework in [Hoshino, Muroya and Hasuo, CSL-LICS 2014] that translates lambda terms with algebraic effects to transducers. Those transducers can be thought of as " proof nets with memories " and are constructed in a compositional manner by means of(More)
In this preliminary report we extend our framework of memoryful Geometry of Interaction (mGoI) [Hoshino, Muroya & Hasuo, CSL-LICS 2014] by recursion. The mGoI framework provides a sound translation from λ-terms to transducers; notably it accommodates algebraic effects introduced by Plotkin and Power; and the translation, defined in terms of a coalgebraic(More)
Girard's Geometry of Interaction (GoI), a semantics designed for linear logic proofs, has been also successfully applied to programming language semantics. One way is to use abstract machines that pass a token on a fixed graph along a path indicated by the GoI. These token-passing abstract machines are space efficient, because they handle duplicated(More)
  • 1