000 04319nam a22006015i 4500
001 978-3-540-69201-0
003 DE-He213
005 20240423132457.0
007 cr nn 008mamaa
008 121227s1997 gw | s |||| 0|eng d
020 _a9783540692010
_9978-3-540-69201-0
024 7 _a10.1007/3-540-63172-0
_2doi
050 4 _aQA76.9.S88
072 7 _aUYD
_2bicssc
072 7 _aCOM011000
_2bisacsh
072 7 _aUYD
_2thema
082 0 4 _a004.2
_223
245 1 0 _aComputer Science Logic
_h[electronic resource] :
_b10th International Workshop, CSL '96, Annual Conference of the EACSL, Utrecht, The Netherlands, September 21 - 27, 1996, Selected Papers /
_cedited by Dirk van Dalen, Marc Bezem.
250 _a1st ed. 1997.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c1997.
300 _aIX, 479 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 ;
_v1258
505 0 _aFour-valued diagnoses for stratified knowledge-bases -- Fast cut-elimination by projection -- On the subject reduction property for algebraic type systems -- Presheaf models for concurrency -- Directed virtual reductions -- Bounded-variable fixpoint queries are PSPACE-complete -- Graph rewriting semantics for functional programming languages -- An extension of models of Axiomatic Domain Theory to models of Synthetic Domain Theory -- Relative undecidability in term rewriting -- Extending models of second order predicate logic to models of second order dependent type theory -- Eta-expansions in F ? -- Cut-free display calculi for relation algebras -- Computational aspects of arity hierarchies -- Weak semantics based on lighted button pressing experiments -- Kleene algebra with tests: Completeness and decidability -- Monadic NP and built-in trees -- Coercive subtyping in type theory -- Proofs in system F ? can be done in system F ? 1 -- Optimization problems with approximation schemes -- Computational representations of herbrand models using grammars -- Exact pairs for abstract bounded reducibilities -- The logic of explicitly presentation-invariant circuits -- Social confluence in client-server systems -- A type-free resource-aware ?-calculus -- Inductive definitions with decidable atomic formulas -- Call-by-Value, call-by-name and the logic of values -- On Cartesian monoids -- New intuitionistic logical constants: Undecidability of the conservativeness problem.
520 _aThis book constitutes the strictly refereed post-workshop proceedings of the 10th International Workshop on Computer Science Logic, CSL'96, held as the 5th Annual Conference of the European Association of Computer Science Logic (EACSL), in Utrecht, The Netherlands, in September 1996. The volume presents 26 revised full papers selected from a total of initially 75 papers submitted; also included are two refereed invited contributions. The volume addresses all current issues in the area of computer science logic research, and is thus a unique record of recent progress in the area.
650 0 _aComputer systems.
650 0 _aComputer science.
650 0 _aMachine theory.
650 0 _aArtificial intelligence.
650 1 4 _aComputer System Implementation.
650 2 4 _aTheory of Computation.
650 2 4 _aFormal Languages and Automata Theory.
650 2 4 _aArtificial Intelligence.
650 2 4 _aComputer Science Logic and Foundations of Programming.
700 1 _aDalen, Dirk van.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aBezem, Marc.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540631729
776 0 8 _iPrinted edition:
_z9783662169650
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v1258
856 4 0 _uhttps://doi.org/10.1007/3-540-63172-0
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
912 _aZDB-2-BAE
942 _cSPRINGER
999 _c188184
_d188184