Verkauf durch Sack Fachmedien

Myers / O'Donnell

Constructivity in Computer Science

Summer Symposium, San Antonio, TX, June 19-22, 1991. Proceedings

Medium: Buch
ISBN: 978-3-540-55631-2
Verlag: Springer
Erscheinungstermin: 24.06.1992
Lieferfrist: bis zu 10 Tage

Mathematicians have long recognized the distinction between
an argument showing that an interesting object exists and a
procedure for actually constructing the object. Computer
science adds a new dimension of interest in constructivity,
since a computer program is a formal description of a
constructive procedure that can be executed automatically.
It has beenover a decade since a conference was devoted to
constructivity, and never before has one been held
specifically relating computer science to constructivity.
Thus, this proceedings volume is the most concentrated
offering ever produced of the diverse ways in which
constructivity and computer science are related. The papers
cover semantics and type theory, logic and theorem proving,
real and complex analysis, topology and combinatorics,
nonconstructive graph-theoretical techniques, and curriculum
and pedagogic issues.
The book offers a concentrated view of the many ways in
which constructivity has assumed importance in computer
science, and contains results available nowhere else.


Produkteigenschaften


  • Artikelnummer: 9783540556312
  • Medium: Buch
  • ISBN: 978-3-540-55631-2
  • Verlag: Springer
  • Erscheinungstermin: 24.06.1992
  • Sprache(n): Englisch
  • Auflage: Erscheinungsjahr 1992
  • Serie: Lecture Notes in Computer Science
  • Produktform: Kartoniert, Paperback
  • Gewicht: 406 g
  • Seiten: 253
  • Format (B x H x T): 155 x 235 x 15 mm
  • Ausgabetyp: Kein, Unbekannt

Themen


Autoren/Hrsg.

Herausgeber

Connecting formal semantics to constructive intuitions.- Kripke semantics for dependent type theory and realizability interpretations.- Reflective semantics of constructive type theory.- Are subsets necessary in Martin-Löf type theory?.- Development transformation based on higher order type theory.- Classical proofs as programs: How, what and why.- Classical type theory.- Axiomatization of calculus of constructions.- A logical view of assignments.- Constructivity issues in graph algorithms.- Constructive topology and combinatorics.- Implementing constructive real analysis (preliminary report).- Examples of semicomputable sets of real and complex numbers.- Bringing mathematics education into the algorithmic age.- The type structure of CAT.- A simple and powerful approach for studying constructivity, computability, and complexity.