Skip to main content Accessibility help
×
Hostname: page-component-7c8c6479df-7qhmt Total loading time: 0 Render date: 2024-03-29T09:04:47.771Z Has data issue: false hasContentIssue false

Geometry of interaction IV: the feedback equation

from RESEARCH ARTICLES

Published online by Cambridge University Press:  30 March 2017

Viggo Stoltenberg-Hansen
Affiliation:
Uppsala Universitet, Sweden
Jouko Väänänen
Affiliation:
University of Helsinki
Get access
Type
Chapter
Information
Logic Colloquium '03 , pp. 76 - 117
Publisher: Cambridge University Press
Print publication year: 2006

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1] V. M., Abrusci and P., Ruet, Non-commutative logic I : the multiplicative fragment, Annals of Pure and Applied Logic, vol. 101 (2000), pp. 29–64.Google Scholar
[2] R., Amadio and P.-L., Curien, Domains and lambda-calculi, Cambridge Tracts in Theoretical Computer Science, vol. 46, Cambridge University Press, 1998.
[3] G., Berry, Stable models of typed lambda-calculi, Proceedings of the 5th international colloquium on automata, languages and programming, Lecture Notes in Computer Science, vol. 62, Springer Verlag, 1978.
[4] A., Connes, Non-commutative geometry, Academic Press, San Diego, CA, 1994.
[5] V., Danos and L., Regnier, The structure ofmultiplicatives, Archive forMathematical Logic, vol. 28 (1989), pp. 181–203.Google Scholar
[6] V., Danos and L., Regnier, Proof-nets and theHilbert space,Advances in linear logic (Girard, Lafont, and Regnier, editors), LondonMathematical Society Lecture Note Series, vol. 222, Cambridge University Press, 1995.
[7] T., Ehrhard, Hypercoherences : a strongly stable model of linear logic, Advances in linear logic (Girard, Lafont, and Regnier, editors), Cambridge University Press, Cambridge, 1995, pp. 83–108.
[8] J.-Y., Girard, Towards a geometry of interaction,Categories in computer science and logic, Proceedings of Symposia in Pure Mathematics, no. 92, American Mathematical Society, Providence, 1988, pp. 69–108.
[9] J.-Y., Girard, Geometry of interaction I : interpretation of system F, Logic colloquium '88 (Ferro, Bonotto, Valentini, and Zanardo, editors), North-Holland, Amsterdam, 1989, pp. 221–260.
[10] J.-Y., Girard, Geometry of interaction II : deadlock-free algorithms,Proceedings of COLOG 88 (Martin-Löf and Mints, editors), Lecture Notes in Computer Science, vol. 417, Springer-Verlag, Heidelberg, 1990, pp. 76–93.
[11] J.-Y., Girard, Geometry of interaction III : accommodating the additives, Advances in linear logic (Girard, Lafont, and Regnier, editors), Cambridge University Press, Cambridge, 1995, pp. 329–389.
[12] J.-Y., Girard, Coherent Banach spaces : a continuous denotational semantics, Theoretical Computer Science, vol. 227 (1999), pp. 275–297.Google Scholar
[13] J.-Y., Girard, Locus Solum, Mathematical Structures in Computer Science, vol. 11 (2001), pp. 301–506.Google Scholar
[14] J.-Y., Girard, Between logic and quantic : a tract, Technical report, Institut de Mathématiques de Luminy, October 2003.
[15] J.-Y., Girard,Y., Lafont, and P., Taylor, Proofs and types, Cambridge tracts in theoretical computer science, vol. 7, Cambridge University Press, Cambridge, 1990.
[16] G., Gonthier, M., Abadi, and J.-J., Levy, The geometry of optimal lambda-reduction, POPL‘92 (ACM Press, editor), Birkhäuser, Boston, 1992.
[17] R. V., Kadison and J. R., Ringrose, Fundamentals of the theory of operator algebras, vol. I, Pure andAppliedMathematics,Academic Press, 1983, (vol. III contains the solutions of exercises of vol. I).
[18] R. V., Kadison and J. R., Ringrose, Fundamentals of the theory of operator algebras, vol. II, Pure and AppliedMathematics, Academic Press, 1986.
[19] G., Kreisel, Mathematical logic, Lectures in modern mathematics, vol. III (T. L., Saaty, editor),Wiley & Sons, New York, 1965, pp. 99–105.
[20] P., Selinger, Towards a quantum computing language, Mathematical Structures in Computer Science, vol. 14 (2004), pp. 527–586.Google Scholar

Save book to Kindle

To save this book to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

Available formats
×