“Higher-order” mathematics in B

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

Volumn 2272, Issue , 2002, Pages 370-393

  Abrial, Jean Raymond ^a   Cansell, Dominique ^b   Laffitte, Guy ^c  

^a LORIA ^*  (France)

^b LORIA   (France)

^c INSEE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

CLASSICAL THEOREMS; HIGHER-ORDER; MATHEMATICAL STRUCTURE;

ARTIFICIAL INTELLIGENCE;

EID: 84948178446     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45648-1_19     Document Type: Conference Paper

References (8)

1. J.R. Abrial. The B-Book:Assigning Programs to Meanings. Cambridge University Press (1996).
2. N. Bourbaki. Théorie des ensembles. Hermann, Paris, 1970.
3. S. Owre, N. Shankar, J. M. Rushby, and D. W. J. Stringer-Calvert PVS language reference version 2. 3. Technical report, SRI International, September 1999.
4. L. C. Paulson and K. Grabczewski. Mechanizing set theory: Cardinal arithmetic and the axiom of choice. Journal of Automated Reasoning, 17(3):291–323, December 1996.
5. Markus Wenzel. Using axiomatic type classes in Isabelle. part of the Isabelle distribution. Technical report, TU München, February 2001.
6. E. Zermelo. Neuer Beweis für die Möglichkeit einer Wohlordnung. Mathematische Annalen, 65:107–128, 1908.
7. A. J. M. van Gasteren. On the Shape of Mathematical Arguments, volume 445 of Lecture Notes in Computer Science. Springer-Verlag, 1990.
8. ClearSy. Atelier B (version 3.6). 2001.