Abstract
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öf’s monomorphic type theory. Our goal is to obtain a formalisation that provides us with computational content, instead of just being a completely abstract theory.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Augustsson, L.: Cayenne - a language with dependent types. In: Proceedings of the Third ACM SIGPLAN International Conference on Functional Programming, 1998, Baltimore, Maryland, United States, pp. 239–250. ACM Press, New York (1998)
Barthe, G., Capretta, V., Pons, O.: Setoids in type theory. Journal of Functional Programming 13(2), 261–293 (2003)
Codd, E.F.: A Relational Model of Data for Large Shared Data Banks. Communications of the ACM 13(6), 377–387 (1970)
Coquand, C.: Agda home page, http://www.cs.chalmers.se/~catarina/agda/
Coquand, C., Coquand, T.: Structured Type Theory. In: Proceedings of Part of PLI 1999 (Colloquium on Principles, Logics, and Implementations of High- Level Programming Languages). Workshop on Logical Frameworks and Meta-languages, Paris, France (September 1999)
Darwen, H., Date, C.J.: The Third Manifesto. ACM SIGMOD Record 24(1), 39–49 (1995)
Gonzalía, C.: The Allegory of E-Relations in Constructive Type Theory. In: Desharnais, J., Frappier, M., MacCaull, W. (eds.) Relational Methods in Computer Science: The Québec Seminar, April 2002, pp. 19–38. Methoδos Verlag (2002)
Gonzalía, C.: Relation Calculus in Martin-Löf Type Theory. Ph. Lic. thesis, Technical Report no. 5L, Department of Computing Science, Chalmers University of Technology and Göteborg University (February 2002)
Hallgren, T.: Alfa home page, http://www.cs.chalmers.se/~hallgren/Alfa/
Hedberg, M.: New standard library for Alfa, http://www.cs.chalmers.se/pub/users/hallgren/Alfa/Alfa/Library/New/
Kawahara, Y., Okhuma, H.: Relational Aspects of Relational Database Dependencies. In: Desharnais, J. (ed.) RelMICS 2000: 5th International Seminar on Relational Methods in Computer Science, Valcartier, Québec, Canada, January 2000, pp. 185–194 (2000)
Mäenpää, P., Tikkanen, M.: Dependent Types in Databases. In: Workshop in Dependent Types in Programming, Göteborg, Sweden (1999)
Nordström, B., Petersson, K., Smith, J.: Programming in Martin-Löf ’s Type Theory. An Introduction. The International Series of Monographs on Computer Science. Oxford University Press, Oxford (1990)
Rajagopalan, P., Tsang, C.P.: A Generic Algebra for Data Collections Based on Constructive Logic. In: Alagar, V.S., Nivat, M. (eds.) AMAST 1995. LNCS, vol. 936, pp. 546–560. Springer, Heidelberg (1995)
Schmidt, G., Ströhlein, T.: Relations and Graphs. Discrete Mathematics for Computer Scientists. EATCS Monographs on Theoretical Computer Science. Springer, Heidelberg (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gonzalía, C. (2004). Towards a Formalisation of Relational Database Theory in Constructive Type Theory. In: Berghammer, R., Möller, B., Struth, G. (eds) Relational and Kleene-Algebraic Methods in Computer Science. RelMiCS 2003. Lecture Notes in Computer Science, vol 3051. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24771-5_12
Download citation
DOI: https://doi.org/10.1007/978-3-540-24771-5_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22145-6
Online ISBN: 978-3-540-24771-5
eBook Packages: Springer Book Archive