Linked bibliography for the SEP article "Games, Full Abstraction and Full Completeness" by Felice Cardone
This is an automatically generated and experimental page
If everything goes well, this page should display the bibliography of the aforementioned article as it appears in the Stanford Encyclopedia of Philosophy, but with links added to PhilPapers records and Google Scholar for your convenience. Some bibliographies are not going to be represented correctly or fully up to date. In general, bibliographies of recent works are going to be much better linked than bibliographies of primary literature and older works. Entries with PhilPapers records have links on their titles. A green link indicates that the item is available online at least partially.
This experiment has been authorized by the editors of the Stanford Encyclopedia of Philosophy. The original article and bibliography can be found here.
- Abramsky, Samson, 1994, “Interaction Categories and
Communicating Sequential Processes”, in A. William Roscoe (ed.),
A Classical Mind: Essays in Honour of C.A.R. Hoare, New York:
Prentice Hall International, pp. 1–16. (Scholar)
- –––, 1996, “Retracing Some Paths in
Process Algebra”, in U. Montanari & V. Sassone (eds.),
CONCUR ’96: Concurrency Theory, 7th International
Conference, Springer-Verlag, pp. 1–17.
[Abramsky 1996 available online] (Scholar)
- –––, 1997, “Semantics of Interaction: An
Introduction to Game Semantics”, in P. Dybjer & A. Pitts
(eds.), Proceedings of the 1996 CLiCS Summer School, Isaac Newton
Institute, Cambridge University Press, pp. 1–31.
[Abramsky 1997 available online] (Scholar)
- –––, 2000, “Axioms for Definability and
Full Completeness”, in G.D. Plotkin, C. Stirling, & M. Tofte
(eds.), Proof, Language, and Interaction, Essays in Honour of
Robin Milner, The MIT Press, pp. 55–76.
[Abramsky 2000 available online] (Scholar)
- Abramsky, Samson & Radha Jagadeesan, 1994, “Games and Full Completeness for Multiplicative Linear Logic”, Journal of Symbolic Logic, 59: 543–574. [Abramsky and Jagadeesan 1994 available online] (Scholar)
- Abramsky, Samson & Guy McCusker, 1999, “Game
Semantics”, in H. Schwichtenberg & U. Berger (eds.),
Computational Logic: Proceedings of the 1997 Marktoberdorf Summer
School, Berlin: Springer-Verlag, pp. 1–56. (Scholar)
- Abramsky, Samson, Radha Jagadeesan, & Pasquale Malacaria,
2000, “Full Abstraction for PCF”, Information and
Computation, 163(2): 409–470.
[Abramsky, Jagadeesan, & Malacaria 2000 available online (Scholar)
- Amadio, Roberto M. & Pierre-Louis Curien, 1998, Domains and Lambda-Calculi (Cambridge Tracts in Theoretical Computer Science, 46), Cambridge: Cambridge University Press. (Scholar)
- Barendregt, Henk P., 1984, The Lambda Calculus, Its Syntax and
Semantics, Amsterdam: North-Holland Co. (Scholar)
- Barendregt, Henk P., Wil Dekkers, & Richard Statman, 2013, Lambda Calculus with Types (Perspectives in Logic), Cambridge: Cambridge University Press/Association for Symbolic Logic. (Scholar)
- Berry, Gérard, 1976, “Bottom-Up Computation of
Recursive Programs”, RAIRO Informatique Théorique et
Applications, 10: 47–82.
[Berry 1976 available online] (Scholar)
- –––, 1978, “Stable Models of Typed
\(\lambda\)-Calculi”, in Giorgio Ausiello & Corrado
Böhm (eds.), Automata, Languages and Programming, Fifth
Colloquium (Lecture Notes in Computer Science, 62), Berlin:
Springer-Verlag, pp. 72–89. doi:10.1007/3-540-08860-1_7 (Scholar)
- Berry, Gérard, Pierre-Louis Curien, & Jean-Jacques
Lévy, 1985, “ Full Abstraction for Sequential Languages:
the State of the Art”, Maurice Nivat & John C. Reynolds
(eds.), Algebraic Methods in Semantics, Cambridge: Cambridge
University Press, pp. 89–131.
[Berry, Curien, & Lévy 1985 available online (Scholar)
- Blass, Andreas, 1992, “A Game Semantics for Linear Logic”, Annals of Pure and Applied Logic, 56(1–3): 183–220. doi:10.1016/0168-0072(92)90073-9 (Scholar)
- Bucciarelli, Antonio, 1994, “Another Approach to
Sequentiality: Kleene’s Unimonotone Functions”, in Stephen
D. Brookes, Michael G. Main, Austin Melton, Michael W. Mislove, &
David A. Schmidt (eds.), Mathematical Foundations of Programming
Semantics, Proceedings of the 9th International Conference, New
Orleans, LA, USA, April 7–10, 1993, (Lecture Notes in
Computer Science, 802), Berlin: Springer, pp. 333–358.
doi:10.1007/3-540-58027-1_17 (Scholar)
- Bucciarelli, Antonio & Thomas Ehrhard, 1994,
“Sequentiality in An Extensional Framework”,
Information and Computation, 110(2): 265–296.
doi:10.1006/inco.1994.1033 (Scholar)
- Cardone, Felice & J. Roger Hindley, 2009, “History of
Lambda-Calculus and Combinators in the 20th Century”, in Dov M.
Gabbay & John Woods (eds.), Handbook of the History of Logic.
Volume 5. Logic from Russell to Church, Amsterdam: Elsevier, pp.
723–817. (Scholar)
- Cartwright, Robert, Pierre-Louis Curien, & Matthias Felleisen,
1994, “Fully Abstract Semantics for Observably Sequential
Languages”, Information and Computation, 111(2):
297–401. doi:10.1006/inco.1994.1047 (Scholar)
- Coquand, Thierry, 1995, “A Semantics of Evidence for Classical Arithmetic”, Journal of Symbolic Logic, 60(1): 325–337. doi:10.2307/2275524 (Scholar)
- Curien, Pierre-Louis, 1986, Categorical Combinators,
Sequential Algorithms and Functional Programming, London: Pitman;
New York: Wiley. (Scholar)
- –––, 1992, “Sequentiality and Full
Abstraction”, in Fourman, Johnstone, & Pitts 1992:
66–94. doi:10.1017/cbo9780511525902.005 (Scholar)
- –––, 1994, “On the Symmetry of
Sequentiality”, in Stephen Brookes, Michael Main, Austin Melton,
Michael Mislove, & David Schmidt (eds.), Mathematical
Foundations of Programming Semantics, 9th International
Conference (Lecture Notes in Computer Science, 802), Berlin:
Springer-Verlag, pp. 29–71. doi:10.1007/3-540-58027-1_2 (Scholar)
- –––, 2003a, “Symmetry and Interactivity in Programming”, Bulletin of Symbolic Logic, 9(2): 169–180. [Curien 2003a available online] (Scholar)
- –––, 2003b, “Playful, Streamlike
Computation”, in Guo-Qiang Zhang, J. Lawson, Ying Ming Liu, M.K.
Luo (eds.), Domain Theory, Logic and Computation, Proceedings of
the 2nd International Symposium on Domain Theory, Sichuan, China,
October 2001 (Semantic Structures in Computation, 3), Dordrecht:
Springer Netherlands, pp. 1–24. doi:10.1007/978-94-017-1291-0_1
[Curien 2003b available online] (Scholar)
- –––, 2007, “Definability and Full
Abstraction”, Electronic Notes in Theoretical Computer
Science, 172(1): 301–310.
doi:10.1016/j.entcs.2007.02.011 (Scholar)
- Fourman, M.P., P.T. Johnstone, & A.M. Pitts (eds.), 1992,
Applications of Categories in Computer Science: Proceedings of the
London Mathematical Society Symposium, Durham 1991 (London
Mathematical Society Lecture Note Series, 177), Cambridge: Cambridge
University Press. (Scholar)
- Girard, Jean-Yves, 1987, “Linear logic”, Theoretical Computer Science, 50(1): 1–102. doi:10.1016/0304-3975(87)90045-4 (Scholar)
- Gunter, Carl A., 1992, Semantics of Programming Languages.
Structures and Techniques, Cambridge, MA: MIT Press. (Scholar)
- Hoare, C.A.R., 1985, Communicating Sequential Processes,
Englewood Cliffs, NJ: Prentice-Hall. (Scholar)
- Hodges, Wilfrid, 2001, “Formal Features of Compositionality”, Journal of Logic, Language and Information, 10(1): 7–28. doi:10.1023/a:1026502210492 (Scholar)
- Hyland, J. Martin E., 1997, “Game Semantics”, in P.
Dybjer & A. Pitts (eds.), Proceedings of the 1996 CLiCS Summer
School, Isaac Newton Institute, Cambridge: Cambridge University
Press, pp. 131–184. (Scholar)
- Hyland, J.M.E. & C.-H.L. Ong, 2000, “On Full Abstraction
for PCF: I., Models, Observables and the Full Abstraction Problem, II.
Dialogue Games and Innocent Strategies, III. a Fully Abstract and
Universal Game Model”, Information and Computation,
163(2): 285–408. doi:10.1006/inco.2000.2917 (Scholar)
- Janssen, Theo M.V., 2001, “Frege, Contextuality and Compositionality”, Journal of Logic, Language and Information, 10(1): 115–136. doi:10.1023/a:1026542332224 (Scholar)
- Joyal, André, 1977, “Remarques sur la Théorie
des Jeux à Deux Personnes”, Gazette des Sciences
Mathématiques du Quebec, 1(4): 46–52. (Scholar)
- Jung, Achim & Allen Stoughton, 1993, “Studying the Fully
Abstract Model of PCF Within Its Continuous Function Model”, in
Marc Bezem & Jjan Friso Groote (eds.), Typed Lambda Calculi
and Applications, Proceedings of the International Conference on Typed
Lambda Calculi and Applications, TLCA ’93, Utrecht, the
Netherlands, March 16–18, 1993, (Lecture Notes on Computer
Science, 664), Berlin: Springer-Verlag, pp. 230–244.
doi:10.1007/bfb0037109 (Scholar)
- Jürjens, Jan, 2002, “Games in the Semantics of Programming Languages—An Elementary Introduction”, Synthese, 133(1–2): 131–158. doi:10.1023/a:1020883810034 (Scholar)
- Kahn, G. & G.D. Plotkin, 1993, “Concrete Domains”,
Theoretical Computer Science, 121(1–2): 187–277.
doi:10.1016/0304-3975(93)90090-g (Scholar)
- Kleene, Stephen Cole, 1952, Introduction to Metamathematics, New York: Van Nostrand. (Scholar)
- Lafont, Yves & Thomas Streicher, 1991, “Games Semantics
for Linear Logic”, in Proceedings Sixth Annual IEEE
Symposium on Logic in Computer Science, IEEE Computer Society,
Los Alamitos, CA, pp. 43–50. doi:10.1109/lics.1991.151629 (Scholar)
- Loader, Ralph, 2001, “Finitary PCF is Not Decidable”,
Theoretical Computer Science, 266(1–2): 341–364.
doi:10.1016/s0304-3975(00)00194-8 (Scholar)
- Longley, John, 2001, “Notions of Computability at Higher
Types, I”, in René Cori, Alexander Razborov, Stevo
Todorcevic, & Carol Wood (eds.), Logic Colloquium 2000
(Lecture Notes in Logic, 19), Wellesley, MA: A.K. Peters, pp.
32–142.
[Longley 2001 available online] (Scholar)
- Longley, John & Dag Normann, 2015, Higher-Order
Computability, Heidelberg: Springer. (Scholar)
- Lorenzen, P., 1961, “Ein Dialogisches
Konstructivitätskriterium”, in Infinitistic Methods,
Proceedings of the Symposium on Foundations of Mathematics (1959 :
Warsaw, Poland), New York: Pergamon Press, pp.
193–200. (Scholar)
- Milner, Robin, 1973, Models for LCF, Technical report,
STAN-CS-73-332, Computer Science Department, Stanford University.
[Milner 1973 available online] (Scholar)
- –––, 1975, “Processes: a Mathematical
Model of Computing Agents”, in H.E. Rose & J.C. Shepherdson
(eds.), Logic Colloquium ’73 (Studies in the Logic and
the Foundations of Mathematics, 80), Amsterdam: North-Holland, pp.
157–174. doi:10.1016/s0049-237x(08)71948-7 (Scholar)
- –––, 1977, “Fully Abstract Models of Typed
\(\lambda\)-Calculi”, Theoretical Computer Science, 4:
1–22. doi:10.1016/0304-3975(77)90053-6 (Scholar)
- –––, 1980, A Calculus of Communicating
Systems (Lecture Notes in Computer Science, 92), Berlin, New
York: Springer-Verlag. doi:10.1007/3-540-10235-3 (Scholar)
- Mitchell, John C., 1993, “On Abstraction and the Expressive
Power of Programming Languages”, Science of Computer
Programming, 21(2): 141–163.
doi:10.1016/0167-6423(93)90004-9 (Scholar)
- Mulmuley, Ketan, 1987, Full Abstraction and Semantic
Equivalence, Cambridge, MA: MIT Press. (Scholar)
- Nickau, Hanno, 1994, “Hereditarily Sequential
Functionals”, in Anil Nerode & Yu V. Matiyasevich (eds.),
Logical Foundations of Computer Science: Proceedings of the Third
International Symposium, LFCS 1994 St. Petersburg, Russia, July
11–14, 1994 (Lecture Notes in Computer Science, 813),
Berlin: Springer-Verlag, pp. 253–264.
doi:10.1007/3-540-58140-5_25 (Scholar)
- Ong, C.-H.L., 1995, “Correspondence Between Operational and
Denotational Semantics”, in Samson Abramsky, Dov M. Gabbay,
& T.S.E. Maibaum (eds.), Handbook of Logic in Computer
Science, vol. 4, Oxford: Oxford University Press, pp.
269–356. (Scholar)
- O’Hearn, Peter W. & Jon G. Riecke, 1995, “Kripke
Logical Relations and PCF”, Information and
Computation, 120(1): 107–116.
doi:10.1006/inco.1995.1103 (Scholar)
- Paolini, Luca, 2006, “A Stable Programming Language”,
Information and Computation, 204(3): 339–375.
doi:10.1016/j.ic.2005.11.002 (Scholar)
- Plotkin, G.D., 1977, “LCF Considered as a Programming
Language”, Theoretical Computer Science, 5(3):
223–257. doi:10.1016/0304-3975(77)90044-5 (Scholar)
- Reynolds, John C., 1981, “The Essence of Algol”, in
J.W. de Bakker & J.C. van Vliet (eds.), Algorithmic Languages:
Proceedings of the International Symposium on Algorithmic
Languages, Amsterdam: North Holland, pp. 345–372. (Scholar)
- Riecke, Jon G., 1993, “Fully Abstract Translations Between
Functional Languages”, Mathematical Structures in Computer
Science, 3(4): 387–415. doi:10.1017/s0960129500000293 (Scholar)
- Sazonov, Vladimir Yu., 1975, “Sequentially and Parallelly
Computable Functionals”, in Corrado Böhm (ed.),
\(\lambda\)-Calculus and Computer Science Theory, Proceedings of
the Symposium Held in Rome, March 25–27, 1975 (Lecture
Notes in Computer Science, 37), Berlin: Springer-Verlag, pp.
312–318. (Scholar)
- –––, 1976, “Degrees of Parallelism in
Computations”, in A.W. Mazurkiewicz (ed.), Mathematical
Foundations of Computer Science 1976, Proceedings of the 5th
Symposium, Gdansk, Poland, September 6–10, 1976, (Lecture
Notes in Computer Science, 45), New York: Springer, pp.
517–523. (Scholar)
- –––, 2007, “Inductive Definition and
Domain Theoretic Properties of Fully Abstract Models for PCF and
PCF+”, Logical Methods in Computer Science, 3(3): paper
7. doi:10.2168/lmcs-3(3:7)2007 (Scholar)
- Scott, Dana S., 1969, “A Type-Theoretical Alternative to
ISWIM, CUCH, OWHY”, Informally distributed. Revised and printed
1993, Theoretical Computer Science, 121: 411–440.
doi:10.1016/0304-3975(93)90095-b (Scholar)
- –––, 1970, “Outline of a Mathematical
Theory of Computation”, in Proceedings of the Fourth Annual
Princeton Conference on Information Sciences and Systems, Dept.
of Electrical Engineering, Princeton University, pp. 169–176.
[Scott 1970 available online] (Scholar)
- –––, 1982, “Domains for Denotational
Semantics”, in M. Nielsen & E. Schmidt (eds.), Automata,
Languages and Programming, Ninth International Colloquium
(Lecture Notes in Computer Science, 140), Berlin: Springer-Verlag, pp.
577–613. doi:10.1007/bfb0012801 (Scholar)
- Scott, Dana S. & Christopher Strachey, 1971, “Toward a
Mathematical Semantics for Computer Languages”, in Jerome Fox
(ed.), Proceedings of the Symposium on Computers and Automata Held
in New York, 13–15 April 1971, New York: Polytechnic
Institute of Brooklyn Press, pp. 19–46.
[Scott and Strachey 1971 available online] (Scholar)
- Sieber, Kurt, 1992, “Reasoning About Sequential Functions
via Logical Relations”, in Fourman, Johnstone, & Pitts 1992:
258–269. doi:10.1017/cbo9780511525902.015 (Scholar)
- Stoughton, Allen, 1988, Fully Abstract Models of Programming
Languages, London: Pitman; New York: Wiley. (Scholar)
- Stoy, Joseph E., 1977, Denotational Semantics: the
Scott-Strachey Approach to Programming Language Theory,
Cambridge, MA: MIT Press. (Scholar)
- Strachey, Christopher, 1966, “Towards a Formal
Semantics”, in Thomas B. Steel, Jr. (ed.), Formal Language
Description Languages for Computer Programming, Amsterdam:
North-Holland, pp. 198–220. (Scholar)
- –––, 1967, “Fundamental Concepts in
Programming Languages”, International Summer School in Computer
Programming, Copenhagen. Revised and reprinted 2000, Higher-Order
and Symbolic Computation, 13(1–2): 11–49.
doi:10.1023/A:1010000313106 (Scholar)
- Streicher, Thomas, 2006, Domain-Theoretic Foundations of
Functional Programming, Singapore: World Scientific. (Scholar)
- Szabó, Zoltán Gendler, 2013,
“Compositionality”, in Edward N. Zalta (ed.), The
Stanford Encyclopedia of Philosophy (Fall 2013.). URL =
<https://plato.stanford.edu/archives/fall2013/entries/compositionality/> (Scholar)
- Turner, Raymond, 2016, “The Philosophy of Computer
Science”, in Edward N. Zalta (ed.), The Stanford
Encyclopedia of Philosophy (Spring 2016.). URL =
<https://plato.stanford.edu/archives/spr2016/entries/computer-science/> (Scholar)
- Vuillemin, Jean, 1974, “Correct and Optimal Implementations
of Recursion in a Simple Programming Language”, Journal of
Computer and System Science, 9(3): 332–354.
doi:10.1016/s0022-0000(74)80048-6 (Scholar)
- White, Graham, 2004, “The Philosophy of Computer
Languages”, in Luciano Floridi (ed.), The Blackwell Guide to
the Philosophy of Computing and Information, Malden, MA:
Blackwell, pp. 237–247. doi:10.1002/9780470757017.ch18 (Scholar)