000 03847nam a22006135i 4500
001 978-3-540-49562-8
003 DE-He213
005 20240423132431.0
007 cr nn 008mamaa
008 121227s1998 gw | s |||| 0|eng d
020 _a9783540495628
_9978-3-540-49562-8
024 7 _a10.1007/BFb0097782
_2doi
050 4 _aQA76.758
072 7 _aUMZ
_2bicssc
072 7 _aCOM051230
_2bisacsh
072 7 _aUMZ
_2thema
082 0 4 _a005.1
_223
245 1 0 _aTypes for Proofs and Programs
_h[electronic resource] :
_bInternational Workshop TYPES'96, Aussois, France, December 15-19, 1996 Selected Papers /
_cedited by Eduardo Gimenez, Christine Paulin-Mohring.
250 _a1st ed. 1998.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c1998.
300 _aVIII, 380 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v1512
505 0 _aCoercion 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.
520 _aThis 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.
650 0 _aSoftware engineering.
650 0 _aComputer science.
650 0 _aMachine theory.
650 0 _aCompilers (Computer programs).
650 0 _aArtificial intelligence.
650 1 4 _aSoftware Engineering.
650 2 4 _aComputer Science Logic and Foundations of Programming.
650 2 4 _aFormal Languages and Automata Theory.
650 2 4 _aCompilers and Interpreters.
650 2 4 _aArtificial Intelligence.
700 1 _aGimenez, Eduardo.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aPaulin-Mohring, Christine.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540651376
776 0 8 _iPrinted edition:
_z9783662200575
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v1512
856 4 0 _uhttps://doi.org/10.1007/BFb0097782
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
912 _aZDB-2-BAE
942 _cSPRINGER
999 _c187704
_d187704