default search action
Tutorial Workshop on Realizability Semantics and Applications@FLoC 1999: Trento, Italy
- Lars Birkedal, Jaap van Oosten, Giuseppe Rosolini, Dana S. Scott:
Tutorial Workshop on Realizability Semantics and Applications, associated to FLoC'99, the 1999 Federated Logic Conference, Trento, Italy, June 30 - July 1, 1999. Electronic Notes in Theoretical Computer Science 23(1), Elsevier 1999 - Samson Abramsky:
Process Realizability. 1-2 - Sergei N. Artëmov:
Uniform provability realization of intuitionistic logic, modality and lambda-terms. 3-12 - Steven Awodey, Lars Birkedal, Dana S. Scott:
Local Realizability Toposes and a Modal Logic for Computability. 13-26 - Ulrich Berger:
Effectivity and Density in Domains: A Survey. 27-39 - Lars Birkedal:
Bibliography on Realizability. 40-57 - Tristan Crolard:
A type theory which is complete for Kreisel's modified realizability. 58-73 - John Longley:
Matching typed and untyped realizability. 74-100 - Jaap van Oosten:
History and Developments. 101-110 - Andrew M. Pitts:
Tripos Theory in Retrospect. 111-127 - Bernhard Reus:
Realizability Models for Type Theories. 128-158 - Giuseppe Rosolini, Thomas Streicher:
Comparing models of higher type computation. 159-165 - Martin Hyland:
Variations on Realizability: Simple examples realizing axioms of choice. 166-188 - Lars Birkedal, Jaap van Oosten, Giuseppe Rosolini, Dana S. Scott:
Preface. 189-190
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.