Wykład będzie nosił tytuł Abstraction in Computer Science.
Abstract
Abstraction in all its forms has played a substantial role in the design of programming languages. It has motivated the various language paradigms, and has inspired, and is manifested in, the rich type structure and machinery of control to be found in contemporary languages. These include specification schemas, procedural abstraction, inheritance, iteration, recursion, polymorphism, abstract data types, modules, and classes.
In this talk we shall provide an analysis of computational abstraction inspired by Frege, and the recent work in the philosophy of mathematics due to Crispin Wright and Bob Hale.
Seemingly, many of the singular terms that appear to refer to abstract entities are characterized by an abstraction principle of the following form:
f(a) = f(b) if and only if R(a,b)
Here R is an equivalence relation and f is a functional term. We shall work within a framework where programming languages are represented as type theories and abstraction involves the introduction of a new type of objects.
♦ Raymond Turner (ur. 1947) jest emerytowanym profesorem Uniwersytetu w Essex. Pracował także jako profesor wizytujący na Uniwersytecie Massachusetts-Amherst, Uniwersytecie Stanforda oraz Uniwersytecie Texas – Austin.
Jego główną specjalnością naukową jest logika oraz teoria i filozofia informatyki.
Jest członkiem redakcji czasopisma Journal of Logic and Computation oraz Stanfordzkiej Encyklopedii Filozoficznej.
W 2017 roku Raymond Turner został laureatem Covey Award – nagrody ustanowionej przez organizację International Association for Computing and Philosophy.
Najważniejsze publikacje książkowe Raymonda Turnera to: Logics for Artificial Intelligence (1984), Truth and Modality for Knowledge Representation (1990), Constructive Foundations for Functional Languages (1991), Computable Models (2009), Computational Artefacts: Towards a Philosophy of Computer Science (2018).