Skip to main content

Directed virtual reductions

  • Conference paper
  • First Online:
Computer Science Logic (CSL 1996)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1258))

Included in the following conference series:

Abstract

This note defines a new graphical local calculus, directed virtual reductions. It is designed to compute Girard's execution formula EX, an invariant of closed functional evaluation obtained from the “geometry of interaction” interpretation of λ-calculus [5].

The calculus is obtained by synchronizing another graphical local calculus presented in “local and asynchronous beta-reduction”: virtual reductions [4]. This synchronization makes it easier to mechanize than general virtual reductions. In undirected virtual reductions the consistency of the computation is insured by an algebraic mechanism called the bar. This mechanism in general induces correction terms of any order. The directed virtual reduction has been designed to keep those terms at order one.

A further synchronization, the combustion strategy will even wipe out first order correction terms. Applied to sharing graphs, the combustion strategy yields Lamping's optimal graphical calculus as presented in [1]. But more efficient optimal implementations of λ-calculus are expected.

The paper is conceived as a follow-up of [4] and supposes a familiarity with virtual reduction.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Martin Abadi, Georges Gonthier, and Jean-Jacques Lévy. Linear logic without boxes. In Proceedings of the 7 th Symposium on Logic in Computer Science. IEEE Computer Society Press, 1992.

    Google Scholar 

  2. Andrea Asperti. δo!∈=1. In Hsiang (Jieh), editor, Proceedings of the Sixth Rewriting Techniques and Applications Conference, pages 102–116. Springer-Verlag, 1995.

    Google Scholar 

  3. A.H. Clifford and G.B. Preston. The algebraic theory of semi-groups. In Mathematical Surveys, volume 7. American Mathematical Society, 1961.

    Google Scholar 

  4. Vincent Danos and Laurent Regnier. Local and asynchronous beta-reduction. In Proceedings of the 8 th Symposium on Logic in Computer Science. IEEE Computer Society Press, 1993.

    Google Scholar 

  5. Jean-Yves Girard. Geometry of interaction I: an interpretation of system F. In Ferro & al., editor, Proceedings of A.S.L. Meetings. North-Holland, 1988.

    Google Scholar 

  6. Jean-Yves Girard. Geometry of interaction III: acommodating the additives. In Jean-Yves Girard, Yves Lafont, and Laurent Regnier, editors, Advances in Linear Logic, volume 222 of London Mathematical Society Lecture Note Series. Cambridge University Press, 1995.

    Google Scholar 

  7. Mario Petrich. Inverse Semigroups. Pure and Applied Mathematics. John Wiley & sons, 1984.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Dirk van Dalen Marc Bezem

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Danos, V., Pedicini, M., Regnier, L. (1997). Directed virtual reductions. In: van Dalen, D., Bezem, M. (eds) Computer Science Logic. CSL 1996. Lecture Notes in Computer Science, vol 1258. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63172-0_33

Download citation

  • DOI: https://doi.org/10.1007/3-540-63172-0_33

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63172-9

  • Online ISBN: 978-3-540-69201-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics