Linked bibliography for the SEP article "The Philosophy of Computer Science" by Nicola Angius, Giuseppe Primiero and Raymond Turner
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 & Guy McCusker, 1995, “Games and Full
Abstraction for the Lazy \(\lambda\)-Calculus”, in D. Kozen
(ed.), Tenth Annual IEEEE Symposium on Logic in Computer
Science, IEEE Computer Society Press, pp. 234–43.
doi:10.1109/lics.1995.523259 (Scholar)
- Abramsky, Samson, Pasquale Malacaria, & Radha Jagadeesan,
1994, “Full Abstraction for PCF”, in M. Hagiya & J.C.
Mitchell (eds.), Theoretical Aspects of Computer Software:
International Symposium TACS ‘94, Sendai, Japan, April
19–22, 1994, Springer-Verlag, pp. 1–15. (Scholar)
- Abrial, Jean-Raymond, 1996, The B-Book: Assigning Programs to
Meanings, Cambridge: Cambridge University Press. (Scholar)
- Alama, Jesse, 2015, “The Lambda Calculus”, The
Stanford Encyclopedia of Philosophy (Spring 2015 Edition), Edward
N. Zalta (ed.), URL =
<https://plato.stanford.edu/archives/spr2015/entries/lambda-calculus/>. (Scholar)
- Allen, Robert J., 1997, A Formal Approach to Software
Architecture, Ph.D. Thesis, Computer Science, Carnegie Mellon
University. Issued as CMU Technical Report CMU-CS-97-144.
Allen 1997 available on line (Scholar)
- Ammann, Paul & Jeff Offutt, 2008, Introduction to Software
Testing, Cambridge: Cambridge University Press. (Scholar)
- Angius, Nicola, 2013a, “Abstraction and Idealization in the Formal Verification of Software”, Minds and Machines, 23(2): 211–226. doi:10.1007/s11023-012-9289-8 (Scholar)
- –––, 2013b, “Model-Based Abductive Reasoning in Automated Software Testing”, Logic Journal of IGPL, 21(6): 931–942. doi:10.1093/jigpal/jzt006 (Scholar)
- –––, 2014, “The Problem of Justification of Empirical Hypotheses in Software Testing”, Philosophy & Technology, 27(3): 423–439. doi:10.1007/s13347-014-0159-6 (Scholar)
- Angius, N., & Primiero, G., 2018, “The logic of identity
and copy for computational artefacts”, Journal of Logic and
Computation, 28(6): 1293–1322. (Scholar)
- Angius, Nicola & Guglielmo Tamburrini, 2011, “Scientific Theories of Computational Systems in Model Checking”, Minds and Machines, 21(2): 323–336. doi:10.1007/s11023-011-9231-5 (Scholar)
- –––, 2017, “Explaining engineered
computing systems’ behaviour: the role of abstraction and
idealization”, Philosophy & Technology, 30(2):
239–258. (Scholar)
- Anscombe, G. E. M., 1963, Intention, second edition,
Oxford: Blackwell. (Scholar)
- Arkoudas, Konstantine & Selmer Bringsjord, 2007, “Computers, Justification, and Mathematical Knowledge”, Minds and Machines, 17(2): 185–202. doi:10.1007/s11023-007-9063-5 (Scholar)
- Arif, R. Mori, E., and Primiero, G, 2018, “Validity and
Correctness before the OS: the case of LEOI and LEOII”, in
Liesbeth de Mol, Giuseppe Primiero (eds.), Reflections on
Programmings Systems - Historical and Philosophical Aspects,
Philosophical Studies Series, Cham: Springer, pp. 15–47. (Scholar)
- Ashenhurst, Robert L. (ed.), 1989, “Letters in the ACM
Forum”, Communications of the ACM, 32(3): 287.
doi:10.1145/62065.315925 (Scholar)
- Baier, A., 1970, “Act and Intent”, Journal of Philosophy, 67: 648–658. (Scholar)
- Baier, Christel & Joost-Pieter Katoen, 2008, Principles of
Model Checking, Cambridge, MA: The MIT Press. (Scholar)
- Bass, Len, Paul C. Clements, & Rick Kazman, 2003 [1997],
Software Architecture in Practice, second edition, Reading,
MA: Addison-Wesley; first edition 1997; third edition, 2012. (Scholar)
- Bechtel, William & Adele Abrahamsen, 2005, “Explanation: A Mechanist Alternative”, Studies in History and Philosophy of Science Part C: Studies in History and Philosophy of Biological and Biomedical Sciences, 36(2): 421–441. doi:10.1016/j.shpsc.2005.03.010 (Scholar)
- Boghossian, Paul A., 1989, “The Rule-following Considerations”, Mind, 98(392): 507–549. doi:10.1093/mind/xcviii.392.507 (Scholar)
- Bourbaki, Nicolas, 1968, Theory of Sets, Ettore Majorana
International Science Series, Paris: Hermann. (Scholar)
- Bratman, M. E., 1987, Intention, Plans, and Practical Reason, Cambridge, MA: Harvard University Press. (Scholar)
- Bridges, Douglas & Palmgren Erik, 2013, “Constructive
Mathematics”, The Stanford Encyclopedia of Philosophy
(Winter 2013 Edition), Edward N. Zalta (ed.), URL =
<https://plato.stanford.edu/archives/win2013/entries/mathematics-constructive/>. (Scholar)
- Brooks, Frederick P. Jr., 1995, The Mythical Man Month: Essays
on Software Engineering, Anniversary Edition, Reading, MA:
Addison-Wesley. (Scholar)
- –––, 1996, “The Computer Scientist as
Toolsmith II”, Communications of the ACM, 39(3):
61–68. doi:10.1145/227234.227243 (Scholar)
- Burge, Tyler, 1998, “Computer Proof, Apriori Knowledge, and Other Minds”, Noûs, 32(S12): 1–37. doi:10.1111/0029-4624.32.s12.1 (Scholar)
- Bynum, Terrell Ward, 2008, “Milestones in the History of
Information and Computer Ethics”, in Himma and Tavani 2008:
25–48. doi:10.1002/9780470281819.ch2 (Scholar)
- Callahan, John, Francis Schneider, & Steve Easterbrook, 1996,
“Automated Software Testing Using Model-Checking”, in
Proceeding Spin Workshop, J.C. Gregoire, G.J. Holzmann and D.
Peled (eds.), New Brunswick, NJ: Rutgers University, pp.
118–127. (Scholar)
- Cardelli, Luca & Peter Wegner, 1985, “On Understanding
Types, Data Abstraction, and Polymorphism”, 17(4):
471–522.
[Cardelli and Wegner 1985 available online] (Scholar)
- Carnap, R., 1966, Philosophical foundations of physics (Vol. 966), New York: Basic Books. (Scholar)
- Carrara, M., Gaio, S., and Soavi, M., 2014, “Artifact kinds,
identity criteria, and logical adequacy”, in M. Franssen, P.
Kroes, T. Reydon and P. E. Vermaas (eds.), Artefact Kinds:
Ontology and The Human-made World, New York: Springer, pp.
85–101. (Scholar)
- Chalmers, A. F., 1999, What is this thing called
Science?, Maidenhead: Open University Press (Scholar)
- Chalmers, David J., 1996, “Does a Rock Implement Every Finite-State Automaton?” Synthese, 108(3): 309–33. [D.J. Chalmers 1996 available online] doi:10.1007/bf00413692 (Scholar)
- Clarke, Edmund M. Jr., Orna Grumberg, & Doron A. Peled, 1999,
Model Checking, Cambridge, MA: The MIT Press. (Scholar)
- Colburn, Timothy R., 1999, “Software, Abstraction, and Ontology”, The Monist, 82(1): 3–19. doi:10.5840/monist19998215 (Scholar)
- –––, 2000, Philosophy and Computer
Science, Armonk, NY: M.E. Sharp. (Scholar)
- Colburn, T. R., Fetzer, J. H. , and Rankin T. L., 1993,
Program Verification: Fundamental Issues in Computer Science,
Dordrecht: Kluwer Academic Publishers. (Scholar)
- Colburn, Timothy & Gary Shute, 2007, “Abstraction in Computer Science”, Minds and Machines, 17(2): 169–184. doi:10.1007/s11023-007-9061-7 (Scholar)
- Copeland, B. Jack, 1993, Artificial Intelligence: A Philosophical Introduction, San Francisco: John Wiley & Sons. (Scholar)
- –––, 1996, “What is Computation?” Synthese, 108(3): 335–359. doi:10.1007/bf00413693 (Scholar)
- –––, 2015, “The Church-Turing Thesis”, The Stanford Encyclopedia of Philosophy (Summer 2015 Edition), Edward N. Zalta (ed.), URL = <https://plato.stanford.edu/archives/sum2015/entries/church-turing/>. (Scholar)
- Copeland, B. Jack & Oron Shagrir, 2007, “Physical Computation: How General are Gandy’s Principles for Mechanisms?” Minds and Machines, 17(2): 217–231. doi:10.1007/s11023-007-9058-2 (Scholar)
- –––, 2011, “Do Accelerating Turing Machines Compute the Uncomputable?” Minds and Machines, 21(2): 221–239. doi:10.1007/s11023-011-9238-y (Scholar)
- Cummins, Robert, 1975, “Functional Analysis”, The Journal of Philosophy, 72(20): 741–765. doi:10.2307/2024640 (Scholar)
- Davidson, D., 1963, “Actions, Reasons, and Causes,” reprinted in Essays on Actions and Events, Oxford: Oxford University Press, 1980, pp. 3–20. (Scholar)
- –––, 1978, “Intending”, reprinted in Essays on Actions and Events, Oxford: Oxford University Press, 1980, pp. 83–102. (Scholar)
- De Millo, Richard A., Richard J. Lipton, & Alan J. Perlis,
1979, “Social Processes and Proofs of Theorems and
Programs”, Communications of the ACM, 22(5):
271–281. doi:10.1145/359104.359106 (Scholar)
- Denning, Peter J., 2005, “Is Computer Science
Science?”, Communications of the ACM, 48(4):
27–31. doi:10.1145/1053291.1053309 (Scholar)
- –––, 2007, “Computing is a Natural
Science”, Communications of the ACM, 50(7):
13–18. doi:10.1145/1272516.1272529 (Scholar)
- Denning, Peter J., Edward A. Feigenbaum, Paul Gilmore, Anthony C.
Hearn, Robert W. Ritchie, & Joseph F. Traub, 1981, “A
Discipline in Crisis”, Communications of the ACM,
24(6): 370–374. doi:10.1145/358669.358682 (Scholar)
- Devlin, Keith, 1994, Mathematics: The Science of Patterns: The
Search for Order in Life, Mind, and the Universe, New York: Henry
Holt. (Scholar)
- Dijkstra, Edsger W., 1970, Notes on Structured
Programming, T.H.-Report 70-WSK-03, Mathematics Technological
University Eindhoven, The Netherlands.
[Dijkstra 1970 available online] (Scholar)
- –––, 1974, “Programming as a Discipline of
Mathematical Nature”, American Mathematical Monthly,
81(6): 608–612.
[Dijkstra 1974 available online (Scholar)
- Distributed Software Engineering, 1997, The Darwin
Language, Department of Computing, Imperial College of Science,
Technology and Medicine, London.
[Darwin language 1997 available online] (Scholar)
- Duhem, P., 1954, The Aim and Structure of Physical Theory, Princeton: Princeton University Press. (Scholar)
- Duijf, H., Broersen, J., and Meyer, J. J. C., 2019,
“Conflicting intentions: rectifying the consistency
requirements”, Philosophical Studies, 176(4):
1097–1118. (Scholar)
- Dummett, Michael A.E., 2006, Thought and Reality, Oxford: Oxford University Press. (Scholar)
- Duncan, William, 2011, “Using Ontological Dependence to
Distinguish between Hardware and Software”, Proceedings of
the Society for the Study of Artificial Intelligence and Simulation of
Behavior Conference: Computing and Philosophy, University of
York, York, UK.
[Duncan 2011 available online (zip file)] (Scholar)
- –––, 2017, “Ontological Distinctions between Hardware and Software”, Applied Ontology, 12(1): 5–32. (Scholar)
- Eden, Amnon H., 2007, “Three Paradigms of Computer Science”, Minds and Machines, 17(2): 135–167. doi:10.1007/s11023-007-9060-8 (Scholar)
- Egan, Frances, 1992, “Individualism, Computation, and Perceptual Content”, Mind, 101(403): 443–59. doi:10.1093/mind/101.403.443 (Scholar)
- Edgar, Stacey L., 2003 [1997], Morality and Machines:
Perspectives on Computer Ethics, Sudbury, MA: Jones &
Bartlett Learning. (Scholar)
- Ferrero, L., 2017, “Intending, Acting, and Doing,” Philosophical Explorations, 20 (Supplement 2): 13–39. (Scholar)
- Fernández, Maribel, 2004, Programming Languages and
Operational Semantics: An Introduction, London: King’s
College Publications. (Scholar)
- Fetzer, James H., 1988, “Program Verification: The Very Idea”, Communications of the ACM, 31(9): 1048–1063. doi:10.1145/48529.48530 (Scholar)
- –––, 1990, Artificial Intelligence: Its Scope and Limits, Dordrecht: Springer Netherlands. (Scholar)
- Feynman, Richard P., 1984–1986, Feynman Lectures on
Computation, Cambridge, MA: Westview Press, 2000. (Scholar)
- Flanagan, Mary, Daniel C. Howe, & Helen Nissenbaum, 2008,
“Embodying Values in Technology: Theory and Practice”, in
Information Technology and Moral Philosophy, Jeroen van den
Hoven and John Weckert (eds.), Cambridge: Cambridge University Press,
pp. 322–353. (Scholar)
- Floridi, Luciano, 2008, “The Method of Levels of Abstraction”, Minds and Machines, 18(3): 303–329. doi:10.1007/s11023-008-9113-7 (Scholar)
- Floridi, Luciano, Nir Fresco, & Giuseppe Primiero, 2015, “On Malfunctioning Software”, Synthese, 192(4): 1199–1220. doi:10.1007/s11229-014-0610-3 (Scholar)
- Floyd, Robert W., 1979, “The Paradigms of
Programming”, Communications of the ACM, 22(8):
455–460. doi:10.1145/1283920.1283934 (Scholar)
- Fowler, Martin, 2003, UML Distilled: A Brief Guide to the
Standard Object Modeling Language, 3rd edition,
Reading, MA: Addison-Wesley. (Scholar)
- Franssen, Maarten, Gert-Jan Lokhorst, & Ibio van de Poel,
2013, “Philosophy of Technology”, The Stanford
Encyclopedia of Philosophy (Winter 2013 Edition), Edward N. Zalta
(ed.), URL =
<https://plato.stanford.edu/archives/win2013/entries/technology/>. (Scholar)
- Frege, Gottlob, 1914, “Letter to Jourdain”, reprinted
in Frege 1980: 78–80. (Scholar)
- –––, 1980, Gottlob Frege: Philosophical and
Mathematical Correspondence, G. Gabriel, H. Hermes, F. Kambartel,
C. Thiel, and A. Veraart (eds.), Oxford: Blackwell Publishers. (Scholar)
- Fresco, Nir & Giuseppe Primiero, 2013, “Miscomputation”, Philosophy & Technology, 26(3): 253–272. doi:10.1007/s13347-013-0112-0 (Scholar)
- Friedman, Batya & Helen Nissenbaum, 1996, “Bias in
Computer Systems”, ACM Transactions on Information Systems
(TOIS), 14(3): 330–347. doi:10.1145/230538.230561 (Scholar)
- Frigg, Roman & Stephan Hartmann, 2012, “Models in Science”, The Stanford Encyclopedia of Philosophy (Fall 2012 Edition), Edward N. Zalta (ed.), URL =<https://plato.stanford.edu/archives/fall2012/entries/models-science/>. (Scholar)
- Gagliardi, Francesco, 2007, “Epistemological Justification
of Test Driven Development in Agile Processes”, Agile
Processes in Software Engineering and Extreme Programming: Proceedings
of the 8th International Conference, XP 2007, Como, Italy, June
18–22, 2007, Berlin: Springer Berlin Heidelberg, pp.
253–256. doi:10.1007/978-3-540-73101-6_48 (Scholar)
- Gamma, Erich, Richard Helm, Ralph Johnson, & John Vlissides,
1994, Design Patterns: Elements of Reusable Object-Oriented
Software, Reading, MA: Addison-Wesley. (Scholar)
- Glennan, Stuart S., 1996, “Mechanisms and the Nature of Causation”, Erkenntnis, 44(1): 49–71. doi:10.1007/bf00172853 (Scholar)
- Glüer, Kathrin & Åsa Wikforss, 2015, “The
Normativity of Meaning and Content”, The Stanford
Encyclopedia of Philosophy (Summer 2015 Edition), Edward N. Zalta
(ed.), URL =
<https://plato.stanford.edu/archives/sum2015/entries/meaning-normativity/>. (Scholar)
- Goguen, Joseph A. & Rod M. Burstall, 1985,
“Institutions: Abstract Model Theory for Computer
Science”, Report CSLI-85-30, Center for the Study of
Language and Information at Stanford University. (Scholar)
- –––, 1992, “Institutions: Abstract Model
Theory for Specification and Programming”, Journal of the
ACM (JACM), 39(1): 95–146. doi:10.1145/147508.147524 (Scholar)
- Gordon, Michael J.C., 1979, The Denotational Description of
Programming Languages, New York: Springer-Verlag. (Scholar)
- Gotterbarn, Donald, 1991, “Computer Ethics: Responsibility
Regained”, National Forum: The Phi Beta Kappa Journal,
71(3): 26–31. (Scholar)
- –––, 2001, “Informatics and Professional Responsibility”, Science and Engineering Ethics, 7(2): 221–230. doi:10.1007/s11948-001-0043-5 (Scholar)
- Gotterbarn, Donald, Keith Miller, & Simon Rogerson, 1997,
“Software Engineering Code of Ethics”, Information
Society, 40(11): 110–118. doi:10.1145/265684.265699 (Scholar)
- Gotterbarn, Donald & Keith W. Miller, 2009, “The Public
is the Priority: Making Decisions Using the Software Engineering Code
of Ethics”, IEEE Computer, 42(6): 66–73.
doi:10.1109/mc.2009.204 (Scholar)
- Gruner, Stefan, 2011, “Problems for a Philosophy of Software Engineering”, Minds and Machines, 21(2): 275–299. doi:10.1007/s11023-011-9234-2 (Scholar)
- Gunter, Carl A., 1992, Semantics of Programming Languages:
Structures and Techniques, Cambridge, MA: MIT Press. (Scholar)
- Gupta, Anil, 2014, “Definitions”, The Stanford Encyclopedia of Philosophy (Fall 2014 Edition), Edward N. Zalta (ed.), URL = <Definitions/">https://plato.stanford.edu/archives/fall2014/entries/Definitions/>. (Scholar)
- Gurevich, Y., 2000, “Sequential Abstract-State Machines
Capture Sequential Algorithms”, ACM Transactions on
Computational Logic (TOCL), 1(1): 77-111. (Scholar)
- –––, 2012, “What is an algorithm?”, in International conference on current trends in theory and practice of computer science, Heidelberg, Berlin: Springer, pp. 31–42. (Scholar)
- Hacking, I., 2014, Why is there a Philosophy of Mathematics at all?, Cambridge: Cambridge University Press. (Scholar)
- Hagar, Amit, 2007, “Quantum Algorithms: Philosophical Lessons”, Minds and Machines, 17(2): 233–247. doi:10.1007/s11023-007-9057-3 (Scholar)
- Hale, Bob, 1987, Abstract Objects, Oxford: Basil Blackwell. (Scholar)
- Hales, Thomas C., 2008, “Formal Proof”, Notices of
the American Mathematical Society, 55(11): 1370–1380. (Scholar)
- Hankin, Chris, 2004, An Introduction to Lambda Calculi for
Computer Scientists, London: King’s College
Publications. (Scholar)
- Harrison, John, 2008, “Formal Proof—Theory and
Practice”, Notices of the American Mathematical
Society, 55(11): 1395–1406. (Scholar)
- Hartmanis, Juris, 1981, “Nature of Computer Science and Its
Paradigms”, pp. 353–354 (in Section 1) of “Quo
Vadimus: Computer Science in a Decade”, J.F. Traub (ed.),
Communications of the ACM, 24(6): 351–369.
doi:10.1145/358669.358677 (Scholar)
- –––, 1993, “Some Observations About the
Nature of Computer Science”, in International Conference on
Foundations of Software Technology and Theoretical Computer
Science, Springer Berlin Heidelberg, pp. 1–12.
doi:10.1007/3-540-57529-4_39 (Scholar)
- Hayes, P. J., 1997, “What is a Computer?”, The Monist, 80(3): 389–404. (Scholar)
- Hempel, C. G., 1970, “On the ‘standard
conception’ of scientific theories”, Minnesota Studies
in the Philosophy of Science, 4: 142–163. (Scholar)
- Henson, Martin C., 1987, Elements of Functional
Programming, Oxford: Blackwell. (Scholar)
- Hilbert, David, 1931, “The Grounding of Elementary Number
Theory”, reprinted in P. Mancosu (ed.), 1998, From Brouwer
to Hilbert: the Debate on the Foundations of Mathematics in the
1920s, New York: Oxford University Press, pp. 266–273. (Scholar)
- Hilbert, David & Wilhelm Ackermann, 1928, Grundzüge Der Theoretischen Logik, translated as Principles of Mathematical Logic, Lewis M. Hammond, George G. Leckie, and F. Steinhardt (trans.), New York: Chelsea, 1950. (Scholar)
- Hill, R.K., 2016, “What an algorithm is”, Philosophy & Technology, 29(1): 35–59. (Scholar)
- –––, 2018, “Elegance in Software”, in Liesbeth de Mol, Giuseppe Primiero (eds.), Reflections on Programmings Systems - Historical and Philosophical Aspects (Philosophical Studies Series), Cham: Springer, pp. 273–286. (Scholar)
- Hoare, C.A.R., 1969, “An Axiomatic Basis for Computer
Programming”, Communications of the ACM, 12(10):
576–580. doi:10.1145/363235.363259 (Scholar)
- –––, 1973, “Notes on Data
Structuring”, in O.J. Dahl, E.W. Dijkstra, and C.A.R. Hoare
(eds.), Structured Programming, London: Academic Press, pp.
83–174. (Scholar)
- –––, 1981, “The Emperor’s Old
Clothes”, Communications of the ACM, 24(2):
75–83. doi:10.1145/1283920.1283936 (Scholar)
- –––, 1985, Communicating Sequential
Processes, Englewood Cliffs, NJ: Prentice Hall.
[Hoare 1985 available online] (Scholar)
- –––, 1986, The Mathematics of Programming:
An Inaugural Lecture Delivered Before the University of Oxford on Oct.
17, 1985, Oxford: Oxford University Press. (Scholar)
- Hodges, Andrews, 2011, “Alan Turing”, The Stanford
Encyclopedia of Philosophy (Summer 2011 Edition), Edward N. Zalta
(ed.), URL =
<https://plato.stanford.edu/archives/sum2011/entries/turing/>. (Scholar)
- Hodges, Wilfrid, 2013, “Model Theory”, The
Stanford Encyclopedia of Philosophy (Fall 2013 Edition), Edward
N. Zalta (ed.), forthcoming URL =
<https://plato.stanford.edu/archives/fall2013/entries/model-theory/>. (Scholar)
- Hopcroft, John E. & Jeffrey D. Ullman, 1969, Formal
Languages and their Relation to Automata, Reading, MA:
Addison-Wesley. (Scholar)
- Hughes, Justin, 1988, “The Philosophy of Intellectual
Property”, Georgetown Law Journal, 77: 287. (Scholar)
- Irmak, Nurbay, 2012, “Software is an Abstract Artifact”, Grazer Philosophische Studien, 86(1): 55–72. (Scholar)
- Johnson, Christopher W., 2006, “What are Emergent Properties
and How Do They Affect the Engineering of Complex Systems”,
Reliability Engineering and System Safety, 91(12):
1475–1481.
[Johnson 2006 available online] (Scholar)
- Johnson-Laird, P. N., 1988, The Computer and the Mind: An
Introduction to Cognitive Science, Cambridge, MA: Harvard
University Press. (Scholar)
- Jones, Cliff B., 1990 [1986], Systematic Software Development
Using VDM, second edition, Englewood Cliffs, NJ: Prentice Hall.
[Jones 1990 available online] (Scholar)
- Kimppa, Kai, 2005, “Intellectual Property Rights in
Software—Justifiable from a Liberalist Position? Free Software
Foundation’s Position in Comparison to John Locke’s
Concept of Property”, in R.A. Spinello & H.T. Tavani (eds.),
Intellectual Property Rights in a Networked World: Theory and
Practice, Hershey, PA: Idea, pp. 67–82. (Scholar)
- Kinsella, N. Stephan, 2001, “Against Intellectual Property”, Journal of Libertarian Studies, 15(2): 1–53. (Scholar)
- Kleene, S. C., 1967, Mathematical Logic, New York: Wiley. (Scholar)
- Knuth, D. E., 1973, The Art of Computer Programming,
second edition, Reading, MA: Addison-Wesley. (Scholar)
- –––, 1974a, “Computer Programming as an
Art”, Communications of the ACM, 17(12): 667–673.
doi:10.1145/1283920.1283929 (Scholar)
- –––, 1974b, “Computer Science and Its
Relation to Mathematics”, The American Mathematical
Monthly, 81(4): 323–343. (Scholar)
- –––, 1977, “Algorithms”,
Scientifc American, 236(4): 63–80. (Scholar)
- Kripke, Saul, 1982, Wittgenstein on Rules and Private Language, Cambridge, MA: Harvard University Press. (Scholar)
- Kroes, Peter, 2010, “Engineering and the Dual Nature of
Technical Artefacts”, Cambridge Journal of Economics,
34(1): 51–62. doi:10.1093/cje/bep019 (Scholar)
- –––, 2012, Technical Artefacts: Creations of
Mind and Matter: A Philosophy of Engineering Design, Dordrecht:
Springer. (Scholar)
- Kroes, Peter & Anthonie Meijers, 2006, “The Dual Nature of Technical Artefacts”, Studies in History and Philosophy of Science, 37(1): 1–4. doi:10.1016/j.shpsa.2005.12.001 (Scholar)
- Kröger, Fred & Stephan Merz, 2008, Temporal Logics
and State Systems, Berlin: Springer. (Scholar)
- Ladd, John, 1988, “Computers and Moral Responsibility: a Framework for An Ethical Analysis”, in Carol C. Gould, (ed.), The Information Web: Ethical & Social Implications of Computer Networking, Boulder, CO: Westview Press, pp. 207–228. (Scholar)
- Landin, P.J., 1964, “The Mechanical Evaluation of
Expressions”, The Computer Journal, 6(4):
308–320. doi:10.1093/comjnl/6.4.308 (Scholar)
- Littlewood, Bev & Lorenzo Strigini, 2000, “Software
Reliability and Dependability: a Roadmap”, ICSE ’00
Proceedings of the Conference on the Future of Software
Engineering, pp. 175–188. doi:10.1145/336512.336551 (Scholar)
- Locke, John, 1690, The Second Treatise of Government.
[Locke 1690 available online] (Scholar)
- Loewenheim, Ulrich, 1989, “Legal Protection for Computer
Programs in West Germany”, Berkeley Technology Law
Journal, 4(2): 187–215.
[Loewenheim 1989 available online]
doi:10.15779/z38q67f (Scholar)
- Long, Roderick T., 1995, “The Libertarian Case Against
Intellectual Property Rights”, Formulations, Autumn,
Free Nation Foundation. (Scholar)
- Loui, Michael C. & Keith W. Miller, 2008, “Ethics and
Professional Responsibility in Computing”, Wiley
Encyclopedia of Computer Science and Engineering, Benjamin Wah
(ed.), John Wiley & Sons.
[Loui and Miller 2008 available online] (Scholar)
- Lowe, E. J., 1998, The Possibility of Metaphysics: Substance, Identity, and Time, Oxford: Clarendon Press. (Scholar)
- Luckham, David C., 1998, “Rapide: A Language and Toolset for
Causal Event Modeling of Distributed System Architectures”, in
Y. Masunaga, T. Katayama, and M. Tsukamoto (eds.), Worldwide
Computing and its Applications, WWCA’98, Berlin: Springer,
pp. 88–96. doi:10.1007/3-540-64216-1_42 (Scholar)
- Machamer, Peter K., Lindley Darden, & Carl F. Craver, 2000, “Thinking About Mechanisms”, Philosophy of Science, 67(1): 1–25. doi:10.1086/392759 (Scholar)
- Magee, Jeff, Naranker Dulay, Susan Eisenbach, & Jeff Kramer,
1995, “Specifying Distributed Software Architectures”,
Proceedings of 5th European Software Engineering Conference (ESEC
95), Berlin: Springer-Verlag, pp. 137–153. (Scholar)
- Markov, A., 1954, “Theory of algorithms”, Tr. Mat. Inst. Steklov 42, pp. 1–14. trans. by Edwin Hewitt in American Mathematical Society Translations, Series 2, Vol. 15 (1960). (Scholar)
- Martin-Löf, Per, 1982, “Constructive Mathematics and
Computer Programming”, in Logic, Methodology and Philosophy
of Science (Volume VI: 1979), Amsterdam: North-Holland, pp.
153–175. (Scholar)
- McGettrick, Andrew, 1980, The Definition of Programming
Languages, Cambridge: Cambridge University Press. (Scholar)
- McLaughlin, Peter, 2001, What Functions Explain: Functional Explanation and Self-Reproducing Systems, Cambridge: Cambridge University Press. (Scholar)
- Meijers, A.W.M., 2001, “The Relational Ontology of Technical
Artifacts”, in P.A. Kroes and A.W.M. Meijers (eds.), The
Empirical Turn in the Philosophy of Technology, Amsterdam:
Elsevier, pp. 81–96. (Scholar)
- Mitchelmore, Michael & Paul White, 2004, “Abstraction in
Mathematics and Mathematics Learning”, in M.J. Høines and
A.B. Fuglestad (eds.), Proceedings of the 28th Conference of the
International Group for the Psychology of Mathematics Education
(Volume 3), Bergen: Programm Committee, pp. 329–336.
[Mitchelmore and White 2004 available online] (Scholar)
- Miller, Alexander & Crispin Wright (eds), 2002, Rule Following and Meaning, Montreal/Ithaca: McGill-Queen's University Press. (Scholar)
- Milne, Robert & Christopher Strachey, 1976, A Theory of
Programming Language Semantics, London: Chapman and Hall. (Scholar)
- Milner, R., 1971, “An algebraic definition of simulation
between programs”, Technical Report, CS-205, pp.
481–489, Department of Computer Science, Stanford
University. (Scholar)
- Mitchell, John C., 2003, Concepts in Programming
Languages, Cambridge: Cambridge University Press. (Scholar)
- Monin, Jean François, 2003, Understanding Formal
Methods, Michael G. Hinchey (ed.), London: Springer (this is
Monin's translation of his own Introduction aux Méthodes
Formelles, Hermes, 1996, first edition; 2000, second edition),
doi:10.1007/978-1-4471-0043-0 (Scholar)
- Mooers, Calvin N., 1975, “Computer Software and
Copyright”, ACM Computing Surveys, 7(1): 45–72.
doi:10.1145/356643.356647 (Scholar)
- Moor, James H., 1978, “Three Myths of Computer Science”, The British Journal for the Philosophy of Science, 29(3): 213–222. (Scholar)
- Morgan, C., 1994, Programming From Specifications,
Englewood Cliffs: Prentice Hall. [Morgan 1994 available online] (Scholar)
- Moschovakis, Y. N., 2001, “What is an algorithm?”, in Mathematics Unlimited—2001 and Beyond, Heidelberg, Berlin: Springer, pp. 919–936. (Scholar)
- Naur, P., 1985, “Programming as theory building”,
Microprocessing and microprogramming, 15(5):
253–261. (Scholar)
- Newell, A., and Simon, H. A., 1961, “Computer simulation of
human thinking” Science, 134(3495):
2011–2017. (Scholar)
- ––– 1972, Human Problem Solving, Englewood Cliffs, NJ: Prentice-Hall. (Scholar)
- –––, 1976, “Computer Science as Empirical Inquiry: Symbols and Search”, Communications of the ACM, 19(3): 113–126. doi:10.1145/1283920.1283930 (Scholar)
- Newell, Allen, Alan J. Perlis, & Herbert A. Simon, 1967,
“Computer Science”, Science, 157(3795):
1373–1374. doi:10.1126/science.157.3795.1373-b (Scholar)
- Nissenbaum,Helen, 1998, “Values in the Design of Computer
Systems”, Computers and Society, 28(1):
38–39. (Scholar)
- Northover, Mandy, Derrick G. Kourie, Andrew Boake, Stefan Gruner, & Alan Northover, 2008, “Towards a Philosophy of Software Development: 40 Years After the Birth of Software Engineering”, Journal for General Philosophy of Science, 39(1): 85–113. doi:10.1007/s10838-008-9068-7 (Scholar)
- Pears, David Francis, 2006, Paradox and Platitude in
Wittgenstein’s Philosophy, Oxford: Oxford University Press.
doi:10.1093/acprof:oso/9780199247707.001.0001 (Scholar)
- Piccinini, Gualtiero, 2007, “Computing Mechanisms”, Philosophy of Science, 74(4): 501–526. doi:10.1086/522851 (Scholar)
- –––, 2008, “Computation without Representation”, Philosophical Studies, 137(2): 206–241. [Piccinini 2008 available online] doi:10.1007/s11098-005-5385-4 (Scholar)
- –––, 2008, “Computers”, Pacific Philosophical Quarterly, 89: 32–73. (Scholar)
- –––, 2015, Physical Computation: A Mechanistic Account, Oxford: Oxford University Press. doi:10.1093/acprof:oso/9780199658855.001.0001 (Scholar)
- Piccinini, Gualtiero & Carl Craver, 2011, “Integrating Psychology and Neuroscience: Functional Analyses as Mechanism Sketches”, Synthese, 183(3): 283–311. doi:10.1007/s11229-011-9898-4 (Scholar)
- Popper, Karl R., 1959, The Logic of Scientific Discovery, London: Hutchinson. (Scholar)
- Primiero, G., 2016, “Information in the philosophy of
computer science”, in Floridi L. (ed.), The Routledge
Handbook of Philosophy of Information, London: Routledge, pp.
90–106. (Scholar)
- –––, 2020, On the Foundations of Computing. New York: Oxford University Press. (Scholar)
- Primiero, G., D.F. Solheim & J.M. Spring, 2019 “On
Malfunction, Mechanisms and Malware Classification”, Philos.
Technol. 32: 339–362.
https://doi.org/10.1007/s13347-018-0334-2 (Scholar)
- Pylyshyn, Z. W., 1984, Computation and Cognition: Towards a Foundation for Cognitive Science, Cambridge, MA: MIT Press. (Scholar)
- Pym, D., J.M. Spring, & P. O’Hearn, 2019, “Why
Separation Logic Works”, Philosophy & Technology,
32: 483–516. (Scholar)
- Rapaport, William J., 1995, “Understanding Understanding: Syntactic Semantics and Computational Cognition”, in Tomberlin (ed.), Philosophical Perspectives, Vol. 9: AI, Connectionism, and Philosophical Psychology, Atascadero, CA: Ridgeview, pp. 49–88. [Rapaport 1995 available online] doi:10.2307/2214212 (Scholar)
- –––, 1999, “Implementation Is Semantic Interpretation”, The Monist, 82(1): 109–30. [Rapaport 1999 available online] (Scholar)
- –––, 2005, “Implementation as Semantic
Interpretation: Further Thoughts”, Journal of
Experimental& Theoretical Artificial Intelligence, 17(4):
385–417.
[Rapaport 2005 available online] (Scholar)
- –––, 2012, “Semiotic systems, computers, and the mind: how cognition could be computing”, International Journal of Signs and Semiotic Systems, 2(1): 32–71 (Scholar)
- –––, 2018, “What is a Computer? A Survey”, Minds and Machines, 28(3): 385–426. (Scholar)
- Reynolds, J.C., 2002, “Separation Logic: a logic for shared
mutable data structures”, in Proceedings of the 17th Annual
IEEE Symposium on Logic in Computer Science, IEEE, pp.
55–74. (Scholar)
- Rombach, Dieter & Frank Seelisch, 2008, “Formalisms in
Software Engineering: Myths Versus Empirical Facts”, in
Balancing Agility and Formalism in Software Engineering,
Springer Berlin Heidelberg, pp. 13–25.
doi:10.1007/978-3-540-85279-7_2 (Scholar)
- Rosenberg, A., 2012, The Philosophy of Science, London: Routledge. (Scholar)
- Ryle G., 1949 [2009], The Concept of Mind, Abingdon:
Routledge
- Schiaffonati, Viola, 2015, “Stretching the Traditional Notion of Experiment in Computing: Explorative Experiments”, Science and Engineering Ethics, 22(3): 1–19. doi:10.1007/s11948-015-9655-z (Scholar)
- Schiaffonati, Viola & Mario Verdicchio, 2014, “Computing and Experiments”, Philosophy & Technology, 27(3): 359–376. doi:10.1007/s13347-013-0126-7 (Scholar)
- Searle, J. R., 1990, “Is the brain a digital computer?” Proceedings and Addresses of the American Philosophical Association, 64(3): 21–37. (Scholar)
- Searle, John R., 1995, The Construction of Social Reality, New York: Free Press. (Scholar)
- Setiya, K., “Intention”, The Stanford Encyclopedia of Philosophy (Fall 2018 Edition), Edward N. Zalta (ed.), URL = <Intention/">https://plato.stanford.edu/archives/fall2018/entries/Intention/>. (Scholar)
- Shanker, S.G., 1987, “Wittgenstein versus Turing on the Nature of Church’s Thesis”, Notre Dame Journal of Formal Logic, 28(4): 615–649. [Shanker 1987 available online] doi:10.1305/ndjfl/1093637650 (Scholar)
- Shavell, Steven & Tanguy van Ypersele, 2001, “Rewards
Versus Intellectual Property Rights”, Journal of Law and
Economics, 44: 525–547 (Scholar)
- Skemp, Richard R., 1987, The Psychology of Learning
Mathematics, Hillsdale, NJ: Lawrence Erlbaum Associates. (Scholar)
- Smith, Brian Cantwell, 1985, “The Limits of Correctness in Computers”, ACM SIGCAS Computers and Society, 14–15(1–4): 18–26. doi:10.1145/379486.379512 (Scholar)
- Snelting, Gregor, 1998, “Paul Feyerabend and Software
Technology”, Software Tools for Technology Transfer,
2(1): 1–5. doi:10.1007/s100090050013 (Scholar)
- Sommerville, Ian, 2016 [1982], Software Engineering,
Reading, MA: Addison-Wesley; first edition, 1982. (Scholar)
- Sprevak, M., 2010, “Computation, individuation, and the received view on representation”, Studies in History and Philosophy of Science, 41(3): 260–270. (Scholar)
- –––, 2012, “Three Challenges to Chalmers
on Computational Implementation”, Journal of Cognitive
Science, 13(2): 107–143. (Scholar)
- Stoy, Joseph E., 1977, Denotational Semantics: The
Scott-Strachey Approach to Programming Language Semantics,
Cambridge, MA: MIT Press. (Scholar)
- Strachey, Christopher, 2000, “Fundamental Concepts in
Programming Languages”, Higher-Order and Symbolic
Computation, 13(1–2): 11–49.
doi:10.1023/a:1010000313106 (Scholar)
- Suber, Peter, 1988, “What Is Software?” Journal of Speculative Philosophy, 2(2): 89–119. [Suber 1988 available online] (Scholar)
- Summerville, I., 2012, Software Engineering, Reading, MA:
Addison-Wesley; first edition, 1982. (Scholar)
- Suppe, Frederick, 1989, The Semantic Conception of Theories and Scientific Realism, Chicago: University of Illinois Press. (Scholar)
- Suppes, Patrick, 1960, “A Comparison of the Meaning and Uses of Models in Mathematics and the Empirical Sciences”, Synthese, 12(2): 287–301. doi:10.1007/bf00485107 (Scholar)
- –––, 1969, “Models of Data”, in
Studies in the Methodology and Foundations of Science,
Dordrecht: Springer Netherlands, pp. 24–35. (Scholar)
- Technical Correspondence, Corporate, 1989, Communications of
the ACM, 32(3): 374–381. Letters from James C. Pleasant,
Lawrence Paulson/Avra Cohen/Michael Gordon, William Bevier/Michael
Smith/William Young, Thomas Clune, Stephen Savitzky, James Fetzer.
doi:10.1145/62065.315927 (Scholar)
- Tedre, Matti, 2011, “Computing as a Science: A Survey of Competing Viewpoints”, Minds and Machines, 21(3): 361–387. doi:10.1007/s11023-011-9240-4 (Scholar)
- –––, 2015, The Science of Computing: Shaping
a Discipline, Boca Raton: CRC Press, Taylor and Francis
Group. (Scholar)
- Tedre, Matti & Ekki Sutinen, 2008, “Three Traditions of
Computing: What Educators Should Know”, Computer Science
Education, 18(3): 153–170.
doi:10.1080/08993400802332332 (Scholar)
- Thagard, P., 1984, “Computer programs as psychological
theories”, Mind, Language and Society, Vienna:
Conceptus-Studien, pp. 77–84. (Scholar)
- Thomasson, Amie, 2007, “Artifacts and Human Concepts”, in Eric Margolis and Stephen Laurence (eds.), Creations of the Mind: Essays on Artifacts and Their Representations, Oxford: Oxford University Press, pp. 52–73. (Scholar)
- Thompson, Simon, 2011, Haskell: The Craft of Functional
Programming, third edition, Reading, MA: Addison-Wesley; first
edition, 1996. (Scholar)
- Tichy, Walter F., 1998, “Should Computer Scientists
Experiment More?”, IEEE Computer, 31(5): 32–40.
doi:10.1109/2.675631 (Scholar)
- Turing, A.M., 1936, “On Computable Numbers, with an
Application to the Entscheidungsproblem”, Proceedings of the
London Mathematical Society (Series 2), 42: 230–65.
doi:10.1112/plms/s2-42.1.230 (Scholar)
- –––, 1950, “Computing Machinery and Intelligence”, Mind, 59(236): 433–460. doi:10.1093/mind/lix.236.433 (Scholar)
- Turner, Raymond, 2007, “Understanding Programming Languages”, Minds and Machines, 17(2): 203–216. doi:10.1007/s11023-007-9062-6 (Scholar)
- –––, 2009a, Computable Models, Berlin: Springer. doi:10.1007/978-1-84882-052-4 (Scholar)
- –––, 2009b, “The Meaning of Programming
Languages”, APA Newsletters, 9(1): 2–7. (This APA
Newsletter is available online; see the Other Internet
Resources.) (Scholar)
- –––, 2010, “Programming Languages as
Mathematical Theories”, in J. Vallverdú (ed.),
Thinking Machines and the Philosophy of Computer Science: Concepts
and Principles, Hershey, PA: IGI Global, pp. 66–82. (Scholar)
- –––, 2011, “Specification”, Minds and Machines, 21(2): 135–152. doi:10.1007/s11023-011-9239-x (Scholar)
- –––, 2012, “Machines”, in H. Zenil
(ed.), A Computable Universe: Understanding and Exploring Nature
as Computation, London: World Scientific Publishing
Company/Imperial College Press, pp. 63–76. (Scholar)
- –––, 2014, “Programming Languages as
Technical Artefacts”, Philosophy and Technology, 27(3):
377–397; first published online 2013.
doi:10.1007/s13347–012–0098-z (Scholar)
- –––, 2018, Computational artifacts: Towards a philosophy of computer science, Berlin Heidelberg: Springer. (Scholar)
- Tymoczko, Thomas, 1979, “The Four Color Problem and Its Philosophical Significance”, The Journal of Philosophy, 76(2): 57–83. doi:10.2307/2025976 (Scholar)
- –––, 1980, “Computers, Proofs and
Mathematicians: A Philosophical Investigation of the Four-Color
Proof”, Mathematics Magazine, 53(3):
131–138. (Scholar)
- Van Fraassen, Bas C., 1980, The Scientific Image, Oxford:
Oxford University Press. doi:10.1093/0198244274.001.0001 (Scholar)
- –––, 1989, Laws and Symmetry, Oxford: Oxford University Press. doi:10.1093/0198248601.001.0001 (Scholar)
- Van Leeuwen, Jan (ed.), 1990, Handbook of Theoretical Computer
Science. Volume B: Formal Models and Semantics, Amsterdam:
Elsevier and Cambridge, MA: MIT Press. (Scholar)
- Vardi, M., 2012, “What is an algorithm?”,
Communications of the ACM, 55(3): 5.
doi:10.1145/2093548.2093549 (Scholar)
- Vermaas, Pieter E. & Wybo Houkes, 2003, “Ascribing Functions to Technical Artifacts: A Challenge to Etiological Accounts of Function”, British Journal of the Philosophy of Science, 54: 261–289. [Vermaas and Houkes 2003 available online] (Scholar)
- Vliet, Hans van, 2008, Software Engineering: Principles and
Practice, 3rd edition, Hoboken, NJ: Wiley. (First edition,
1993) (Scholar)
- von Neumann, J. (1945). “First draft report on the
EDVAC”, IEEE Annals of the History of Computing, 15(4):
27–75. (Scholar)
- Wang, Hao, 1974, From Mathematics to Philosophy, London: Routledge, Kegan & Paul. (Scholar)
- Wegner, Peter, 1976, “Research Paradigms in Computer
Science”, in Proceedings of the 2nd international Conference
on Software Engineering, Los Alamitos, CA: IEEE Computer Society
Press, pp. 322–330. (Scholar)
- White, Graham, 2003, “The Philosophy of Computer
Languages”, in Luciano Floridi (ed.), The Blackwell Guide to
the Philosophy of Computing and Information, Malden:
Wiley-Blackwell, pp. 318–326.
doi:10.1111/b.9780631229193.2003.00020.x (Scholar)
- Wiener, Norbert, 1948, Cybernetics: Control and Communication in the Animal and the Machine, New York: Wiley & Sons. (Scholar)
- –––, 1964, God and Golem, Inc.: A Comment on
Certain Points Where Cybernetics Impinges on Religion, Cambridge,
MA: MIT press. (Scholar)
- Wittgenstein, Ludwig, 1953 [2001], Philosophical Investigations, translated by G.E.M. Anscombe, 3rd Edition, Oxford: Blackwell Publishing. (Scholar)
- –––, 1956 [1978], Remarks of the Foundations of Mathematics, G.H. von Wright, R. Rhees, and G.E.M. Anscombe (eds.), translated by G.E.M. Anscombe, revised edition, Oxford: Basil Blackwell. (Scholar)
- –––, 1939 [1975], Wittgenstein’s
Lectures on the Foundations of Mathematics, Cambridge 1939, C.
Diamond (ed.), Cambridge: Cambridge University Press. (Scholar)
- Woodcock, Jim & Jim Davies, 1996, Using Z: Specification,
Refinement, and Proof, Englewood Cliffs, NJ: Prentice Hall. (Scholar)
- Wright, Crispin 1983, Frege’s Conception of Numbers as Objects, Aberdeen: Aberdeen University Press. (Scholar)