Types for proofs and programs : international workshop TYPES '93, Nijmegen, The Netherlands, May 24-28, 1993 : selected papers

This volume contains thoroughly refereed and revised full papers selected from the presentations at the first workshop held under the auspices of the ESPRIT Basic Research Action 6453 Types for Proofs and Programs in Nijmegen, The Netherlands, in May 1993. As the whole ESPRIT BRA 6453, this volume i...

Celý popis

Uloženo v:
Podrobná bibliografie
Korporativní autor: International workshop TYPES :Nimègue, Pays-Bas
Další autoři: Barendregt, Hendrik Pieter, 1947- (Šéfredaktor, odpovědný redaktor), Nipkow, Tobias, 1958-..., informaticien (Šéfredaktor, odpovědný redaktor)
Médium: Livre numérique
Jazyk:Anglais
Vydáno: Berlin [etc.] : Springer [20..].
Cham : Springer Nature
Edice:Lecture notes in computer science 806
Témata:
On-line přístup:Accès sur la plateforme de l'éditeur
Accès sur la plateforme Istex
Accès Université d'Orléans
Accès INSA CVL
Poznámka: Archives Springer e-books (Licence nationale)
Archives Springer e-books (Licence nationale)
Autres localisations: Voir dans le Sudoc
Edition sous un autre format:• Types for proofs and programs, international workshop TYPES '93, Nijmegen, The Netherlands, May 24-28, 1993, selected papers, Henk Barendregt, Tobias Nipkow, eds, Berlin, Springer-Verlag, 1994, 1 vol. (383 p.), Lecture notes in computer science, 3-540-58085-9
• Types for Proofs and Programs, Texte imprimé, 9783662204559
Obsah:
  • Proving strong normalization of CC by modifying realizability semantics
  • Checking algorithms for Pure Type Systems
  • Infinite objects in type theory
  • Conservativity between logics and typed ? calculi
  • Logic of refinement types
  • Proof-checking a data link protocol
  • Elimination of extensionality in Martin-Löf type theory
  • Programming with streams in Coq a case study: The Sieve of Eratosthenes
  • The Alf proof editor and its proof engine
  • Encoding Z-style Schemas in type theory
  • The expressive power of Structural Operational Semantics with explicit assumptions
  • Developing certified programs in the system Coq the program tactic
  • Closure under alpha-conversion
  • Machine Deduction
  • Type theory and the informal language of mathematics
  • Semantics for abstract clauses.