Constructivity in Computer Science Summer Symposium, San Antonio, TX, June 19-22, 1991. Proceedings
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 construct...
| Other Authors: | , |
|---|---|
| Format: | eBook |
| Language: | English |
| Published: |
Berlin, Heidelberg
Springer Berlin Heidelberg
1992, 1992
|
| Edition: | 1st ed. 1992 |
| Series: | Lecture Notes in Computer Science
|
| Subjects: | |
| Online Access: | |
| Collection: | Springer Book Archives -2004 - Collection details see MPG.ReNa |
Table of 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