Vai al contenuto principale della pagina

Types for Proofs and Programs [[electronic resource] ] : International Workshop TYPES'96, Aussois, France, December 15-19, 1996 Selected Papers / / edited by Eduardo Gimenez, Christine Paulin-Mohring



(Visualizza in formato marc)    (Visualizza in BIBFRAME)

Titolo: Types for Proofs and Programs [[electronic resource] ] : International Workshop TYPES'96, Aussois, France, December 15-19, 1996 Selected Papers / / edited by Eduardo Gimenez, Christine Paulin-Mohring Visualizza cluster
Pubblicazione: Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1998
Edizione: 1st ed. 1998.
Descrizione fisica: 1 online resource (VIII, 380 p.)
Disciplina: 004/.01/5113
Soggetto topico: Software engineering
Computer logic
Mathematical logic
Programming languages (Electronic computers)
Artificial intelligence
Software Engineering/Programming and Operating Systems
Logics and Meanings of Programs
Mathematical Logic and Formal Languages
Programming Languages, Compilers, Interpreters
Artificial Intelligence
Persona (resp. second.): GimenezEduardo
Paulin-MohringChristine
Note generali: Bibliographic Level Mode of Issuance: Monograph
Nota di contenuto: Coercion synthesis in computer implementations of type-theoretic frameworks -- Verification of the interface of a small proof system in coq -- An implementation of the Heine-Borel covering theorem in type theory -- Detecting and removing dead-code using rank 2 intersection -- A type-free formalization of mathematics where proofs are objects -- Higman's lemma in type theory -- A proof of weak termination of typed ??-calculi -- Proof style -- Some algorithmic and proof-theoretical aspects of coercive subtyping -- Semantical BNF -- The internal type theory of a Heyting pretopos -- Inverting inductively defined relations in LEGO -- A generic normalisation proof for pure type systems -- Proving a real time algorithm for ATM in Coq -- Dependent types with explicit substitutions: A meta-theoretical development -- Type inference verified: Algorithm W in Isabelle/HOL -- Continuous lattices in formal topology -- Abstract insertion sort in an extension of type theory with record types and subtyping.
Sommario/riassunto: This book constitutes the thoroughly revised post-workshop proceedings of the first annual workshop held under the auspices of the ESPRIT Working Group 21900 TYPES in Aussois, France in December 1996. The 18 revised full papers presented in the book were carefully reviewed and selected from the 30 papers accepted for presentation at the workshop. All current aspects of type theory and type systems and their applications to program verification and theorem proving are addressed; the proof systems and theorem provers dealt with include Coq, LEGO, and Isabelle/HOL.
Titolo autorizzato: Types for Proofs and Programs  Visualizza cluster
ISBN: 3-540-49562-2
Formato: Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione: Inglese
Record Nr.: 9910144122303321
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Serie: Lecture Notes in Computer Science, . 0302-9743 ; ; 1512