Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    UID:
    gbv_595127215
    Format: Online-Ressource (X, 246 S.)
    Edition: Online-Ausg. Berlin [u.a.] Springer 2006 Springer lecture notes archive
    ISBN: 9783540472650
    Series Statement: Lecture notes in computer science 613
    Content: 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.
    Content: 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.
    Note: Literaturangaben
    Additional Edition: ISBN 3540556311
    Additional Edition: ISBN 9783540556312
    Additional Edition: Erscheint auch als Druck-Ausgabe Constructivity in computer science Berlin : Springer, 1992 ISBN 3540556311
    Additional Edition: ISBN 0387556311
    Language: English
    Subjects: Computer Science
    RVK:
    Keywords: Softwareentwicklung ; Konstruktive Methode ; Konferenzschrift
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    UID:
    almahu_9947921016402882
    Format: XI, 253 p. , online resource.
    ISBN: 9783540472650
    Series Statement: Lecture Notes in Computer Science, 613
    Content: 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.
    Note: 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.
    In: Springer eBooks
    Additional Edition: Printed edition: ISBN 9783540556312
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    UID:
    almahu_9948621243802882
    Format: XI, 253 p. , online resource.
    Edition: 1st ed. 1992.
    ISBN: 9783540472650
    Series Statement: Lecture Notes in Computer Science, 613
    Content: 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.
    Note: 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.
    In: Springer Nature eBook
    Additional Edition: Printed edition: ISBN 9783540556312
    Additional Edition: Printed edition: ISBN 9783662197899
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 4
    UID:
    edocfu_9959186358102883
    Format: 1 online resource (XI, 253 p.)
    Edition: 1st ed. 1992.
    Edition: Online edition Springer Lecture Notes Archive ; 041142-5
    ISBN: 3-540-47265-7
    Series Statement: Lecture Notes in Computer Science, 613
    Content: 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.
    Note: Bibliographic Level Mode of Issuance: Monograph , 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. , English
    In: Springer eBooks
    Additional Edition: ISBN 3-540-55631-1
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 5
    UID:
    edoccha_9959186358102883
    Format: 1 online resource (XI, 253 p.)
    Edition: 1st ed. 1992.
    Edition: Online edition Springer Lecture Notes Archive ; 041142-5
    ISBN: 3-540-47265-7
    Series Statement: Lecture Notes in Computer Science, 613
    Content: 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.
    Note: Bibliographic Level Mode of Issuance: Monograph , 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. , English
    In: Springer eBooks
    Additional Edition: ISBN 3-540-55631-1
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 6
    UID:
    gbv_1649294158
    Format: Online-Ressource
    ISBN: 9783540472650
    Series Statement: Lecture Notes in Computer Science 613
    Additional Edition: ISBN 9783540556312
    Additional Edition: Buchausg. u.d.T. Constructivity in computer science Berlin : Springer, 1992 ISBN 3540556311
    Additional Edition: ISBN 0387556311
    Language: English
    Subjects: Computer Science
    RVK:
    Keywords: Softwareentwicklung ; Konstruktive Methode ; Konferenzschrift
    URL: Cover
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 7
    UID:
    almafu_9959186358102883
    Format: 1 online resource (XI, 253 p.)
    Edition: 1st ed. 1992.
    Edition: Online edition Springer Lecture Notes Archive ; 041142-5
    ISBN: 3-540-47265-7
    Series Statement: Lecture Notes in Computer Science, 613
    Content: 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.
    Note: Bibliographic Level Mode of Issuance: Monograph , 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. , English
    In: Springer eBooks
    Additional Edition: ISBN 3-540-55631-1
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Did you mean 9783540472605?
Did you mean 9783540427650?
Did you mean 9783540162650?
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages