000 04226nam a22006375i 4500
001 978-3-642-02444-3
003 DE-He213
005 20240423125842.0
007 cr nn 008mamaa
008 100301s2009 gw | s |||| 0|eng d
020 _a9783642024443
_9978-3-642-02444-3
024 7 _a10.1007/978-3-642-02444-3
_2doi
050 4 _aQA76.6-76.66
072 7 _aUM
_2bicssc
072 7 _aCOM051000
_2bisacsh
072 7 _aUM
_2thema
082 0 4 _a005.11
_223
245 1 0 _aTypes for Proofs and Programs
_h[electronic resource] :
_bInternational Conference, TYPES 2008 Torino, Italy, March 26-29, 2008 Revised Selected Papers /
_cedited by Stefano Berardi, Ferruccio Damiani, Ugo de Liguoro.
250 _a1st ed. 2009.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2009.
300 _aVIII, 323 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v5497
505 0 _aType Inference by Coinductive Logic Programming -- About the Formalization of Some Results by Chebyshev in Number Theory -- A New Elimination Rule for the Calculus of Inductive Constructions -- A Framework for the Analysis of Access Control Models for Interactive Mobile Devices -- Proving Infinitary Normalization -- First-Class Object Sets -- Monadic Translation of Intuitionistic Sequent Calculus -- Towards a Type Discipline for Answer Set Programming -- Type Inference for a Polynomial Lambda Calculus -- Local Theory Specifications in Isabelle/Isar -- Axiom Directed Focusing -- A Type System for Usage of Software Components -- Merging Procedural and Declarative Proof -- Using Structural Recursion for Corecursion -- Manifest Fields and Module Mechanisms in Intensional Type Theory -- A Machine-Checked Proof of the Average-Case Complexity of Quicksort in Coq -- Coalgebraic Reasoning in Coq: Bisimulation and the ?-Coiteration Scheme -- A Process-Model for Linear Programs -- Some Complexity and Expressiveness Results on Multimodal and Stratified Proof Nets.
520 _aThis book constitutes the thoroughly refereed post-conference proceedings of TYPES 2008, the last of a series of meetings of the TYPES working group funded by the European Union between 1993 and 2008; the workshop has been held in Torino, Italy, in March 2008. The 19 revised full papers presented were carefully reviewed and selected from 27 submissions. The topic of the workshop was formal reasoning and computer programming based on type theory: languages and computerized tools for reasoning, and applications in several domains such as analysis of programming languages, certified software, mobile code, formalization of mathematics, mathematics education.
650 0 _aComputer programming.
650 0 _aComputer science.
650 0 _aMachine theory.
650 0 _aCompilers (Computer programs).
650 0 _aComputer science
_xMathematics.
650 0 _aArtificial intelligence.
650 1 4 _aProgramming Techniques.
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 _aSymbolic and Algebraic Manipulation.
650 2 4 _aArtificial Intelligence.
700 1 _aBerardi, Stefano.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aDamiani, Ferruccio.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _ade Liguoro, Ugo.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783642024436
776 0 8 _iPrinted edition:
_z9783642024450
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v5497
856 4 0 _uhttps://doi.org/10.1007/978-3-642-02444-3
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cSPRINGER
999 _c182389
_d182389