RALL: Machine-Supported proofs for relation algebra

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1249, Issue , 1997, Pages 380-394

  von Oheimb, David ^a   Gritzner, Thomas F ^b  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

^b BUNDESWEHR UNIVERSITY MUNICH   (Germany)

Author keywords

Atom structure; Interactive and automatic theorem proving; Isabelle; Relation algebra

Indexed keywords

ALGEBRA; AUTOMATION; CALCULATIONS;

ALGEBRAIC LANGUAGES; ATOM STRUCTURE; AUTOMATIC THEOREM PROVING; INTERACTIVE PROOFS; ISABELLE; RELATION ALGEBRAS; RELATIONAL CALCULUS; THEOREM PROVING SYSTEMS;

THEOREM PROVING;

EID: 84949942277     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63104-6_36     Document Type: Conference Paper

References (28)

1. Backhouse, R.C., Hoogendijk, P., Voermans, E., van der Woude, J.C.S.P: A relational theory of datatypes. Eindhoven University of Technology, Dept, of Mathematics and Computer Science (1992)
2. Berghammer, R., Hattensperger, C., Schmidt, G.: RALF - A relation-algebraic formula manipulation system and proof checker. In: Nivat, M., Rattray, C., Rus, T., Scollo, G. (Eds.): Proc. 3rd Conference on Algebraic Methodology and Software Technology - AMAST '93. Series: Workshops in Computing, Springer- Verlag (1994) 407-408
3. Berghammer, R., Schmidt, G.: Relational specifications. In: Rauszer C. (ed.): Algebraic Methods in Logic and in Computer Science. Series: Banach Center Publications 28, Polish Academy of Sciences (1993) 167-190
4. 31967)
5. Brink, C., Schmidt, G.: Relational methods in computer science. Schlofi Dagstuhl, Seminar Nr. 9403, Technischer Bericht Nr. 80 (1994)
6. Church, A.: A Formulation of the Simple Theory of Types. In: Journal of Symbolic Logic (1940) 56
7. Desharnais, J., Baltagi, S., Chaib-draa, B.: Simple weak sufficient conditions for sharpness. Université Laval, Quebec, Research Report DIUL-RR-9404 (1994)
8. Gritzner, T.F.: Die Axiomatik abstrakter Relationenalgebren: Darstellung der Grundlagen und Anwendung auf das Unschärfeproblem relationaler Produkte. Technische Universität München, Diploma Thesis, also available as report: TUM- INFO-04-91 (1991)
9. Gritzner, T.F.: wp-Kalkül und relationale Spezifikation kommunizierender Sys- teme. Technische Universität München, Doctoral Dissertation (1995) Herbert Utz Verlag Wissenschaft, ISBN 3-931327-64-7 (1996)
10. Haeberer, A.M. (Ed.): Relational methods in computer science. Proceedings of PARATI '95. In preparation.
11. Henkin, L., Monk, J.D., Tarski, A., Cylindric Algebras, Parts I & II, Series: Studies in Logic and the Foundations of Mathematics 64 (1971) k. 115 (1985), North-Holland Publ.Co.
12. Hoare, C.A.R., He Jifeng: The weakest prespecification, parts I&II. In: Funda- menta Informaticae IX (1986) 51-84 & 217-252
13. Jónsson, B., Tarski, A.: Boolean algebras with operators, parts I&II. In: American Journal of Mathematics 73 (1951) 891-939 & 74 (1952) 127-167
14. Kawahaxa, Y., Furusawa, H.: An algebraic formalization of fuzzy relations. Draft paper (April 19, 1995)
15. Lyndon, R.C., The representation of relation(al) algebras, parts I&II, in: Annals of Mathematics (II) 51 (1950) 707-729 & 63 (1956) 294-307, Princeton University Press
16. Maddux, R.: Finite integral relation algebras. In: Comer, S.D. (ed.), Universal Algebra and Lattice Theory, Lecture Notes in Mathematics 1149 (1985) 175-197, Springer-Verlag
17. Nipkow, T.: Term Rewriting and Beyond - Theorem Proving in Isabelle. In: Formal Aspects of Computing 1 (1989) 320-338
18. Nipkow, T.: Order-Sorted Polymorphism in Isabelle. In: Huet, G., Plotkin, G. (eds.): Logical Environments. Cambridge University Press (1993) 164-188
19. von Oheimb, D.: Zur Konstruktion eines auf Isabelle gestützten Beweissystems für die Relationenalgebra. Technische Universität München, Praktische Semester- arbeit (1995)
20. Ounalli, H., Jaoua, A.: On fuzzy difunctional relations. Draft paper presented at 2nd RelMiCS - PARATI '95.
21. Paulson, L.C.: ML for the Working Programmer. Cambridge University Press (1991)
22. Paulson, L.C.: Isabelle - A Generic Theorem Prover. Lecture Notes in Computer Science 828 (1994)
23. Rasmussen, O.: Formalizing Ruby in Isabelle ZF. In: Paulson, L.C. (Ed.): Proceedings of the First Isabelle Users Workshop. University of Cambridge (1995) 246-265
24. de Roever, W.P.: Recursive Program Schemes: Semantics and Proof Theory. Vrije Universiteit te Amsterdam, Doctoral Dissertation (1974)
25. Schmidt, G., Ströhlein, Th: Relations and Graphs. Series: EATCS Monographs in Computer Science, Springer-Verlag (1993)
26. Tarski, A.: On the calculus of relations. In: Journal of Symbolic Logic 6 (1941) 73-89
27. Tarski, A., Givant, S.: A Formalization of Set Theory Without Variables. AMS Colloquium Publications 41 (1987)
28. Zierer, H.: Programmierung mit Funktionsobjekten: Konstruktive Erzeugung se- mantischer Bereiche und Anwendung auf die partielle Auswertung. Technische Universität München, Doctoral Dissertation, also available as: TUM-I8803 (1988)