000 03216nam a22005655i 4500
001 978-3-540-47770-9
003 DE-He213
005 20160624102026.0
007 cr nn 008mamaa
008 121227s1995 gw | s |||| 0|eng d
020 _a9783540477709
_9978-3-540-47770-9
024 7 _a10.1007/3-540-60579-7
_2doi
050 4 _aQA8.9-QA10.3
072 7 _aUYA
_2bicssc
072 7 _aMAT018000
_2bisacsh
072 7 _aCOM051010
_2bisacsh
082 0 4 _a005.131
_223
245 1 0 _aTypes for Proofs and Programs
_h[electronic resource] :
_bInternational Workshop TYPES '94 Båstad, Sweden, June 6–10, 1994 Selected Papers /
_cedited by Peter Dybjer, Bengt Nordström, Jan Smith.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1995.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1995.
300 _aX, 210 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,
_x0302-9743 ;
_v996
505 0 _aCommunicating contexts: A pragmatic approach to information exchange -- A short and flexible proof of strong normalization for the calculus of constructions -- Codifying guarded definitions with recursive schemes -- The metatheory of UTT -- A user's friendly syntax to define recursive functions as typed ?-terms -- I/O automata in Isabelle/HOL -- A concrete final coalgebra theorem for ZF set theory -- On extensibility of proof checkers -- Syntactic categories in the language of mathematics -- Formalization of a ?-calculus with explicit substitutions in Coq.
520 _aThis book presents a strictly refereed collection of revised full papers selected from the papers accepted for the TYPES '94 Workshop, held under the auspices of the ESPRIT Basic Research Action 6453 Types for Proofs and Programs in Bastad, Sweden, in June 1994. The 10 papers included address various aspects of developing computer-assisted proofs and programs using a logical framework. Type theory and three logical frameworks based on it are dealt with: ALF, Coq, and LEGO; other topics covered are metatheory, the Isabelle system, 2-calculus, proof checkers, and ZF set theory.
650 0 _aComputer science.
650 0 _aLogic design.
650 0 _aArtificial intelligence.
650 0 _aLogic, Symbolic and mathematical.
650 1 4 _aComputer Science.
650 2 4 _aMathematical Logic and Formal Languages.
650 2 4 _aLogics and Meanings of Programs.
650 2 4 _aProgramming Languages, Compilers, Interpreters.
650 2 4 _aArtificial Intelligence (incl. Robotics).
650 2 4 _aMathematical Logic and Foundations.
700 1 _aDybjer, Peter.
_eeditor.
700 1 _aNordström, Bengt.
_eeditor.
700 1 _aSmith, Jan.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783540605799
786 _dSpringer
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v996
856 4 0 _uhttp://dx.doi.org/10.1007/3-540-60579-7
942 _2EBK6182
_cEBK
999 _c35476
_d35476