feed icon rss

Your email was sent successfully. Check your inbox.

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

Proceed reservation?

Export
  • 1
    Online Resource
    Online Resource
    Berlin [u.a.] : Springer
    UID:
    b3kat_BV036039503
    Format: 1 Online-Ressource (XIV, 111 S.) , graph. Darst.
    ISBN: 3540085319 , 0387085319
    Series Statement: Lecture notes in computer science 58
    Language: English
    Subjects: Computer Science , Economics
    RVK:
    RVK:
    Keywords: Programmiersprache ; Gleichungssystem ; Rekursion ; Programmierung
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Book
    Book
    Cambridge, Mass. u.a. :MIT Pr.,
    UID:
    almafu_BV002286063
    Format: 296 S.
    ISBN: 0-262-15028-X
    Note: MIT Press series in the foundations of computing
    Language: English
    Subjects: Computer Science , Mathematics
    RVK:
    RVK:
    Keywords: Programmiersprache ; Mathematische Logik
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    Book
    Book
    Berlin [u.a.] :Springer,
    UID:
    almahu_BV001985387
    Format: XIV, 111 S. : , graph. Darst.
    ISBN: 3-540-08531-9 , 0-387-08531-9
    Series Statement: Lecture notes in computer science 58
    Language: English
    Subjects: Computer Science , Economics
    RVK:
    RVK:
    Keywords: Programmiersprache ; Gleichungssystem ; Rekursion ; Programmierung
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 4
    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 ...
  • 5
    UID:
    gbv_435349376
    Format: X, 389 S.
    Note: Literaturverz. S. 370-381
    Language: Undetermined
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 6
    Book
    Book
    Berlin : Springer
    UID:
    gbv_1608290433
    Format: XIV, 111 S. , Ill.
    ISBN: 3540085319 , 0387085319
    Series Statement: Lecture notes in computer science 58
    Note: Literaturverz. S. [109] - 111
    Additional Edition: Online-Ausg. O'Donnell, M.J. Computing in Systems Described by Equations Berlin, Heidelberg : Springer Berlin Heidelberg, 1977 ISBN 9783540359838
    Additional Edition: Online-Ausg. O'Donnell, Michael J. Computing in systems described by equations Berlin [u.a.] : Springer, 1977 ISBN 9783540359838
    Language: English
    Subjects: Computer Science , Economics
    RVK:
    RVK:
    RVK:
    Keywords: Programmiersprache ; Gleichungssystem ; Rekursion ; Programmierung ; Gleichungslogik
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 7
    UID:
    gbv_1858576539
    Format: 1 Online-Ressource (vii, 151 pages)
    Note: Thesis (doctoral)--St. Patrick's College, Maynooth, 1907
    Additional Edition: Erscheint auch als Druck-Ausgabe O'Donnell, Michael J., 1881-1944 Penance in the early church Dublin : Gill, 1907
    Language: English
    Keywords: Hochschulschrift
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 8
    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 ...
  • 9
    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 ...
  • 10
    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 ...
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages