J.Paul Jr. Myers / Michael J. O'Donnell (eds.)

Constructivity in Computer Science

Summer Symposium, San Antonio, TX, June 19-22, 1991. Proceedings
Mitarbeit:Myers, J. P.; O'Donnell, Michael J.

• Broschiertes Buch

Produktbeschreibung

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

---

Hinweis: Dieser Artikel kann nur an eine deutsche Lieferadresse ausgeliefert werden.

Produktdetails

• Lecture Notes in Computer Science 613
• Verlag: Springer / Springer Berlin Heidelberg / Springer, Berlin
• Artikelnr. des Verlages: 978-3-540-55631-2
• 1992.
• Seitenzahl: 264
• Erscheinungstermin: 24. Juni 1992
• Englisch
• Abmessung: 235mm x 155mm x 15mm
• Gewicht: 393g
• ISBN-13: 9783540556312
• ISBN-10: 3540556311
• Artikelnr.: 09255264

Inhaltsangabe

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.