Towards a Formalisation of Relational Database Theory in Constructive Type Theory
Paper i proceeding, 2004

We offer here an overview of several initial attempts of formalisation of relational database theory in a constructive, type-theoretic, framework. Each successive formalisation is of more generality, and correspondingly more complex, than the previous one. All our work is carried out in the proof editor Alfa for Martin-Löfrsquos monomorphic type theory. Our goal is to obtain a formalisation that provides us with computational content, instead of just being a completely abstract theory.

type theory

relational databases

formalized mathematics

Författare

Carlos Gonzalía

Göteborgs universitet

Chalmers, Institutionen för datavetenskap

Relational and Kleene-Algebraic Methods in Computer Science: 7th International Seminar on Relational Methods in Computer Science and 2nd International Workshop on Applications of Kleene Algebra, Bad Malente, Germany, May 12-17, 2003, Revised Selected Papers

Vol. LNCS 137-148

Ämneskategorier

Datavetenskap (datalogi)

DOI

10.1007/978-3-540-24771-5_12

ISBN

3-540-22145-X