Abstract
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 Power. The translation is compositional, hence ``denotational,'' where transducers are inductively composed using an adaptation of Barbosa's coalgebraic component calculus. In the current paper we extend the mGoI framework and provide a systematic treatment of recursion---an essential feature of programming languages that was however missing in our previous work. Specifically, we introduce two new fixed-point operators in the coalgebraic component calculus. The two follow the previous work on recursion in GoI and are called Girard style and Mackie style: the former obviously exhibits some nice domain-theoretic properties, while the latter allows simpler construction. Their equivalence is established on the categorical (or, traced monoidal) level of abstraction, and is therefore generic with respect to the choice of algebraic effects. Our main result is an adequacy theorem of our mGoI translation, against Plotkin and Power's operational semantics for algebraic effects.
- S. Abramsky, R. Jagadeesan, and P. Malacaria. Full abstraction for PCF. Information and Computation, 163(2):409–470, 2000. Google Scholar
Digital Library
- S. Abramsky, E. Haghverdi, and P. J. Scott. Geometry of Interaction and linear combinatory algebras. Math. Struct. in Comp. Sci., 12(5): 625–665, 2002. Google Scholar
Digital Library
- U. Dal Lago and U. Schöpp. Type inference for sublinear space functional programming. In Programming Languages and Systems, volume 6461 of Lecture Notes in Computer Science, pages 376–391. Springer Berlin Heidelberg, 2010. Google Scholar
Digital Library
- V. Danos and L. Regnier. Local and asynchronous beta-reduction (an analysis of girard’s execution formula). In Logic in Computer Science, 1993. LICS ’93., Proceedings of Eighth Annual IEEE Symposium on, pages 296–306, 1993.Google Scholar
Cross Ref
- J. Egger, R. E. Møgelberg, and A. Simpson. Enriching an effect calculus with linear types. In E. Grädel and R. Kahle, editors, Computer Science Logic, volume 5771 of Lecture Notes in Computer Science, pages 240–254. Springer Berlin Heidelberg, 2009. Google Scholar
Digital Library
- M. Fernández and I. Mackie. Call-by-value λ-graph rewriting without rewriting. In A. Corradini, H. Ehrig, H.-J. Kreowski, and G. Rozenberg, editors, Graph Transformation, volume 2505 of Lecture Notes in Computer Science, pages 75–89. Springer Berlin Heidelberg, 2002. Google Scholar
Digital Library
- D. Ghica. Geometry of Synthesis: a structured approach to VLSI design. In POPL 2007, pages 363–375. ACM, 2007. Google Scholar
Digital Library
- D. R. Ghica and A. I. Smith. Geometry of synthesis II: from games to delay-insensitive circuits. Electr. Notes Theor. Comput. Sci., 265: 301–324, 2010. Google Scholar
Digital Library
- D. R. Ghica and A. I. Smith. Geometry of synthesis III: resource management through type inference. In T. Ball and M. Sagiv, editors, Proceedings of the 38th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2011, Austin, TX, USA, January 26- 28, 2011, pages 345–356. ACM, 2011. Google Scholar
Digital Library
- D. R. Ghica, A. I. Smith, and S. Singh. Geometry of Synthesis IV: compiling affine recursion into static hardware. In ICFP, pages 221– 233, 2011. Google Scholar
Digital Library
- J.-Y. Girard. Geometry of interaction 1: Interpretation of system F. In S. V. R. Ferro, C. Bonotto and A. Zanardo, editors, Logic Colloquium ’88 Proceedings of the Colloquium held in Padova, volume 127 of Studies in Logic and the Foundations of Mathematics, pages 221–260. Elsevier, 1989.Google Scholar
- J. Y. Girard. Geometry of interaction 2: Deadlock-free algorithms. In Proceedings of the International Conference on Computer Logic, COLOG-88, pages 76–93, New York, NY, USA, 1990. Springer-Verlag New York, Inc. ISBN 0-387-52335-9. Google Scholar
Digital Library
- E. Haghverdi. Towards a geometry of recursion. Theor. Comput. Sci., 412(20):2015–2028, Apr. 2011. ISSN 0304-3975.. Google Scholar
Digital Library
- M. Hasegawa. On traced monoidal closed categories. Math. Struct. in Comp. Sci., 19(2):217–244, 2009. Google Scholar
Digital Library
- N. Hoshino. A modified GoI interpretation for a linear functional programming language and its adequacy. In FoSSaCS 2011, volume 6604 of Lect. Notes Comp. Sci., pages 320–334. Springer, 2011. Google Scholar
Digital Library
- N. Hoshino, K. Muroya, and I. Hasuo. Memoryful Geometry of Interaction: from coalgebraic components to algebraic effects. In CSL-LICS 2014, page 52. ACM, 2014. Google Scholar
Digital Library
- J. Hyland and C.-H. Ong. On full abstraction for PCF: I, II, and III. Information and Computation, 163(2):285–408, 2000. Google Scholar
Digital Library
- A. Joyal, R. Street, and D. Verity. Traced monoidal categories. Math. Proc. Cambridge Phil. Soc., 119(3):447–468, 1996.Google Scholar
Cross Ref
- U. D. Lago, C. Faggian, B. Valiron, and A. Yoshimizu. Parallelism and synchronization in an infinitary context. In LICS, 2015.Google Scholar
Digital Library
- O. Laurent. A token machine for full Geometry of Interaction. In TLCA, pages 283–297, 2001. Google Scholar
Digital Library
- S. Mac Lane. Categories for the working mathematician. Springer, 1998.Google Scholar
- I. Mackie. The Geometry of Interaction machine. In POPL 1995, pages 198–208. ACM, 1995. Google Scholar
Digital Library
- E. Moggi. Computational lambda-calculus and monads. Tech. Report, pages 1–23, 1988.Google Scholar
- J. S. Pinto. Implantation Parallèle avec la Logique Linéaire (Applications des Réseaux d’Interaction et de la Géométrie de l’Interaction). PhD thesis, École Polytechnique, 2001. Main text in English.Google Scholar
- G. Plotkin and J. Power. Adequacy for algebraic effects. In FoSSaCS 2001, volume 2030 of Lect. Notes Comp. Sci., pages 1–24. Springer, 2001. Google Scholar
Digital Library
- G. Plotkin and J. Power. Algebraic operations and generic effects. Appl. Categorical Struct., 11(1):69–94, 2003.Google Scholar
- J. Power and E. Robinson. Premonoidal categories and notions of computation. Math. Struct. in Comp. Sci., 7(5):453–468, 1997. Google Scholar
Digital Library
- U. Schöpp. Computation-by-interaction with effects. In H. Yang, editor, Programming Languages and Systems, volume 7078 of Lecture Notes in Computer Science, pages 305–321. Springer Berlin Heidelberg, 2011. Google Scholar
Digital Library
- U. Schöpp. Call-by-value in a basic logic for interaction. In J. Garrigue, editor, Programming Languages and Systems, volume 8858 of Lecture Notes in Computer Science, pages 428–448. Springer International Publishing, 2014.Google Scholar
- U. Schöpp. From call-by-value to interaction by typed closure conversion. In APLAS, 2015. To appear.Google Scholar
Cross Ref
Index Terms
Memoryful geometry of Interaction II: recursion and adequacy
Recommendations
Memoryful geometry of interaction: from coalgebraic components to algebraic effects
CSL-LICS '14: Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)Girard's Geometry of Interaction (GoI) 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 ...
Memoryful geometry of Interaction II: recursion and adequacy
POPL '16: Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming LanguagesA 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 ...
Formalizing Adequacy: A Case Study for Higher-order Abstract Syntax
Adequacy is an important criterion for judging whether a formalization is suitable for reasoning about the actual object of study. The issue is particularly subtle in the expansive case of approaches to languages with name-binding. In prior work, ...






Comments