0
Your cart

Your cart is empty

Browse All Departments
  • All Departments
Price
  • R1,000 - R2,500 (2)
  • -
Status
Brand

Showing 1 - 2 of 2 matches in All Departments

Algebraic Groups. Utrecht 1986 - Proceedings of a Symposium in Honour of T.A. Springer (Paperback, 1987 ed.): Arjeh M. Cohen,... Algebraic Groups. Utrecht 1986 - Proceedings of a Symposium in Honour of T.A. Springer (Paperback, 1987 ed.)
Arjeh M. Cohen, Wim H. Hesselink, Wilberd L J Van Der Kallen, Jan R. Strooker
R1,328 Discovery Miles 13 280 Ships in 10 - 15 working days

From 1-4 April 1986 a Symposium on Algebraic Groups was held at the University of Utrecht, The Netherlands, in celebration of the 350th birthday of the University and the 60th of T.A. Springer. Recognized leaders in the field of algebraic groups and related areas gave lectures which covered wide and central areas of mathematics. Though the fourteen papers in this volume are mostly original research contributions, some survey articles are included. Centering on the Symposium subject, such diverse topics are covered as Discrete Subgroups of Lie Groups, Invariant Theory, D-modules, Lie Algebras, Special Functions, Group Actions on Varieties.

Programs, Recursion and Unbounded Choice (Paperback): Wim H. Hesselink Programs, Recursion and Unbounded Choice (Paperback)
Wim H. Hesselink
R1,489 Discovery Miles 14 890 Ships in 10 - 15 working days

This book is a complete account of the predicate transformation calculus semantics of sequential programs, including repetitions, recursive procedures, computational induction and unbounded nondeterminacy. Predicate transformation semantics are the best specification method for the development of correct and well-structured computer programs. The author develops this theory to a greater depth than has been achieved before, and describes it in a way that makes it readily compatible with programming rules for partial and total correctness of repetitions and recursive procedures, supplies new rules for proving incorrectness, and a stronger rule for proving that two programs satisfy the same specifications. Finally, the semantics are extended so that non-terminating programs can be specified as well. This will be essential reading for all computer scientists working in specification and verification of programs.

Free Delivery
Pinterest Twitter Facebook Google+
You may like...
Bostik GluGo - Adhesive Remover (90ml)
R54 Discovery Miles 540
Hani - A Life Too Short
Janet Smith, Beauregard Tromp Paperback R310 R248 Discovery Miles 2 480
Chicco Natural Feeling Manual Breast…
R799 R378 Discovery Miles 3 780
Hisense Combination Refrigerator (White)
R5,699 R4,199 Discovery Miles 41 990
Farm Killings In South Africa
Nechama Brodie Paperback R335 R288 Discovery Miles 2 880
Poop Scoopa
R399 R241 Discovery Miles 2 410
Casio LW-200-7AV Watch with 10-Year…
R999 R884 Discovery Miles 8 840
Loot
Nadine Gordimer Paperback  (2)
R398 R330 Discovery Miles 3 300
Loot
Nadine Gordimer Paperback  (2)
R398 R330 Discovery Miles 3 300
Bug-A-Salt 3.0 Black Fly
 (1)
R999 Discovery Miles 9 990

 

Partners