default search action
Constructivity in Computer Science 1991: San Antonio, Texas, USA
- J. Paul Myers Jr., Michael J. O'Donnell:
Constructivity in Computer Science, Summer Symposium, San Antonio, Texas, USA, June 19-22, Proceedings. Lecture Notes in Computer Science 613, Springer 1992, ISBN 3-540-55631-1
Semantics
- Stuart A. Kurtz, John C. Mitchell, Michael J. O'Donnell:
Connecting Formal Semantics to Constructive Intuitions. 1-21 - James Lipton:
Kripke Semantics for Dependent Type Theory and Realizability Interpretations. 22-32
Types
- Scott F. Smith:
Reflective Semantics of Constructive Type Theory: Preliminary Report. 33-45 - Simon J. Thompson:
Are Subsets Necessary in Martin-Löf Type Theory? 46-57 - Jianguo Lu, Jiafu Xu:
Development Transformation Based on Higher Order Type Theory. 58-70
Logic
- Chetan R. Murthy:
Classical Proofs as Programs: How, What, and Why. 71-88 - Maria Napierala:
Classical Type Theory. 89-107 - Yong Sun:
Axiomatization of Calculus of Constructions. 108-130 - Vipin Swarup, Uday S. Reddy:
A Logical View of Assignments. 131-149
Nonconstructive Techniques
- Michael R. Fellows, Michael A. Langston:
Constructivity Issues in Graph Algorithms. 150-158
Topology
- Thierry Coquand:
Constructive Topology and Combinatorics. 159-164
Reals
- Jawahar Chirimar, Douglas J. Howe:
Implementing Constructive Real Analysis: Preliminary Report. 165-178 - John V. Tucker, Jeffery I. Zucker:
Examples of Semicomputable Sets of Real and Complex Numbers. 179-198
Curriculum/Pedagogy
- Newcomb Greenleaf:
Bringing Mathematics Education into the Algorithmic Age. 199-217 - J. Paul Myers Jr., Ronald E. Prather:
The Type Structure of CAT. 218-227 - Klaus Weihrauch:
A Simple and Powerful Approach for Studying Constructivity, Computability, and Complexity. 228-246
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.