|
Computational abstraction| old_uid | 17695 |
|---|
| title | Computational abstraction |
|---|
| start_date | 2019/04/10 |
|---|
| schedule | 18h-20h |
|---|
| online | no |
|---|
| summary | The practice of Computer Science is dominated by various processes or devices of abstraction. Many these devices are built into specification and programming languages. Indeed, they are the mechanisms of language design, and the process of abstraction maybe seen as generating new languages from given ones. Our objective in this paper is to provide a logical analysis of such abstraction.
Much contemporary logical research on abstraction has been inspired by Frege’s brief remarks. However, this work has largely been aimed at classical logic and mathematics where the ultimate goal has been to abstract the axioms of Zermelo- Fraenkel set theory. Little work has been aimed at other foundational frameworks such as type theory, the central carrier of computational abstraction. Our intention is to explore how the way of abstraction may provide a foundational framework for the latter. |
|---|
| responsibles | Joinet |
|---|
| |
|