Amazon cover image
Image from Amazon.com

Constructivity in Computer Science [electronic resource] : Summer Symposium San Antonio, TX, June 19–22, 1991 Proceeding / edited by J. Paul Myers, Michael J. O'Donnell.

Contributor(s): Material type: TextTextSeries: Lecture Notes in Computer Science ; 613Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 1992Description: XI, 253 p. online resourceContent type:
  • text
Media type:
  • computer
Carrier type:
  • online resource
ISBN:
  • 9783540472650
Subject(s): Additional physical formats: Printed edition:: No titleDDC classification:
  • 005.131 23
LOC classification:
  • QA8.9-QA10.3
Online resources:
Contents:
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 eBooksSummary: 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.
Item type: E-BOOKS
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Current library Home library Call number Materials specified URL Status Date due Barcode
IMSc Library IMSc Library Link to resource Available EBK6025

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.

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.

There are no comments on this title.

to post a comment.
The Institute of Mathematical Sciences, Chennai, India