Cantitate/Preț
Produs

Constructivity in Computer Science: Summer Symposium, San Antonio, TX, June 19-22, 1991. Proceedings: Lecture Notes in Computer Science, cartea 613

Editat de J.Paul Jr. Myers, Michael J. O'Donnell
en Limba Engleză Paperback – 24 iun 1992
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 ways inwhich constructivity has assumed importance in computerscience, and contains results available nowhere else.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 29304 lei

Preț vechi: 36630 lei
-20%

Puncte Express: 440

Preț estimativ în valută:
5614 6095$ 4815£

Carte tipărită la comandă

Livrare economică 06-11 mai

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540556312
ISBN-10: 3540556311
Pagini: 264
Ilustrații: XI, 253 p.
Dimensiuni: 155 x 233 x 14 mm
Greutate: 0.38 kg
Ediția:1992
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Descriere

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 ways inwhich constructivity has assumed importance in computerscience, and contains results available nowhere else.

Cuprins

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.