LEADER 06142nam 22007335 450 001 996466138903316 005 20200702111952.0 010 $a3-540-49404-9 024 7 $a10.1007/BFb0022242 035 $a(CKB)1000000000234286 035 $a(SSID)ssj0000322126 035 $a(PQKBManifestationID)11246832 035 $a(PQKBTitleCode)TC0000322126 035 $a(PQKBWorkID)10281487 035 $a(PQKB)10037626 035 $a(DE-He213)978-3-540-49404-1 035 $a(PPN)155175211 035 $a(EXLCZ)991000000000234286 100 $a20121227d1995 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aComputer Science Logic$b[electronic resource] $e8th Workshop, CSL '94, Kazimierz, Poland, September 25 - 30, 1994. Selected Papers /$fedited by Leszek Pacholski, Jerzy Tiuryn 205 $a1st ed. 1995. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1995. 215 $a1 online resource (XI, 553 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v933 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-60017-5 327 $aSubtyping with singleton types -- A subtyping for the Fisher-Honsell-Mitchell lambda calculus of objects -- The Girard Translation extended with recursion -- Decidability of higher-order subtyping with intersection types -- A ?-calculus structure isomorphic to Gentzen-style sequent calculus structure -- Usability: formalising (un)definedness in typed lambda calculus -- Lambda representation of operations between different term algebras -- Semi-unification and generalizations of a particularly simple form -- A mixed linear and non-linear logic: Proofs, terms and models -- Cut free formalization of logic with finitely many variables. Part I. -- How to lie without being (easily) convicted and the lengths of proofs in propositional calculus -- Monadic second-order logic and linear orderings of finite structures -- First-order spectra with one binary predicate -- Monadic logical definability of NP-complete problems -- Logics for context-free languages -- Log-approximable minimization problems on random inputs -- Convergence and 0?1 laws for L ?,? k under arbitrary measures -- Is first order contained in an initial segment of PTIME? -- Logic programming in Tau Categories -- Reasoning and rewriting with set-relations I: Ground completeness -- Resolution games and non-liftable resolution orderings -- On existential theories of list concatenation -- Completeness of resolution for definite answers with case analysis -- Subrecursion as a basis for a feasible programming language -- A sound metalogical semantics for input/output effects -- An intuitionistic modal logic with applications to the formal verification of hardware -- Towards machine-checked compiler correctness for higher-order pure functional languages -- Powerdomains, powerstructures and fairness -- Canonical forms for data-specifications -- An algebraic view of structural induction -- On the interpretation of type theory in locally cartesian closed categories -- Algorithmic aspects of propositional tense logics -- Stratified default theories -- A homomorphism concept for ?-regularity -- Ramified recurrence and computational complexity II: Substitution and poly-space -- General form recursive equations I -- Modal logics preserving admissible for S4 inference rules -- A bounded set theory with Anti-Foundation Axiom and inductive definability. 330 $aThis volume contains revised refereed versions of the best papers presented during the CSL '94 conference, held in Kazimierz, Poland in September 1994; CSL '94 is the eighth event in the series of workshops held for the third time as the Annual Conference of the European Association for Computer Science Logic. The 38 papers presented were selected from a total of 151 submissions. All important aspects of the methods of mathematical logic in computer science are addressed: lambda calculus, proof theory, finite model theory, logic programming, semantics, category theory, and other logical systems. Together, these papers give a representative snapshot of the area of logical foundations of computer science. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v933 606 $aComputers 606 $aProgramming languages (Electronic computers) 606 $aMathematical logic 606 $aComputer logic 606 $aArtificial intelligence 606 $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005 606 $aProgramming Languages, Compilers, Interpreters$3https://scigraph.springernature.com/ontologies/product-market-codes/I14037 606 $aMathematical Logic and Foundations$3https://scigraph.springernature.com/ontologies/product-market-codes/M24005 606 $aMathematical Logic and Formal Languages$3https://scigraph.springernature.com/ontologies/product-market-codes/I16048 606 $aLogics and Meanings of Programs$3https://scigraph.springernature.com/ontologies/product-market-codes/I1603X 606 $aArtificial Intelligence$3https://scigraph.springernature.com/ontologies/product-market-codes/I21000 615 0$aComputers. 615 0$aProgramming languages (Electronic computers). 615 0$aMathematical logic. 615 0$aComputer logic. 615 0$aArtificial intelligence. 615 14$aTheory of Computation. 615 24$aProgramming Languages, Compilers, Interpreters. 615 24$aMathematical Logic and Foundations. 615 24$aMathematical Logic and Formal Languages. 615 24$aLogics and Meanings of Programs. 615 24$aArtificial Intelligence. 676 $a004/.01/5113 702 $aPacholski$b Leszek$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aTiuryn$b Jerzy$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aWorkshop on Computer Science Logic 906 $aBOOK 912 $a996466138903316 996 $aComputer Science Logic$9771972 997 $aUNISA