LEADER 06259nam 22007215 450 001 996466267403316 005 20200630015537.0 010 $a3-540-48383-7 024 7 $a10.1007/3-540-57887-0 035 $a(CKB)1000000000234098 035 $a(SSID)ssj0000327180 035 $a(PQKBManifestationID)11912776 035 $a(PQKBTitleCode)TC0000327180 035 $a(PQKBWorkID)10298448 035 $a(PQKB)10125367 035 $a(DE-He213)978-3-540-48383-0 035 $a(PPN)155208713 035 $a(EXLCZ)991000000000234098 100 $a20121227d1994 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aTheoretical Aspects of Computer Software$b[electronic resource] $eInternational Symposium TACS ?94 Sendai, Japan, April 19?22, 1994 Proceedings /$fedited by Masami Hagiya, John C. Mitchell 205 $a1st ed. 1994. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1994. 215 $a1 online resource (XI, 892 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v789 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-57887-0 327 $aFull Abstraction for PCF (extended abstract) -- Fully abstract semantics for concurrent ?-calculus -- An operational approach to combining classical set theory and functional programming languages -- ML typing, explicit polymorphism and qualified types -- Extensions to type systems can preserve operational equivalences -- Constraint programming and database query languages -- Intuitionistic resolution for a logic programming language with scoping constructs -- Proof by pointing -- A computer-checked verification of Milner's scheduler -- A purely functional language with encapsulated assignment -- Simple termination of hierarchical combinations of term rewriting systems -- Separate abstract interpretation for control-flow analysis -- Extensible denotational language specifications -- A normalizing calculus with overloading and subtyping -- A theory of primitive objects -- Programming objects with ML-ART an extension to ML with abstract and record types -- A type system for a lambda calculus with assignments -- Theory and practice of Concurrent Object-Oriented Computing -- The family relation in Interaction Systems -- On syntactic and semantic action refinement -- Locality and true-concurrency in calculi for mobile processes -- Term rewriting properties of SOS axiomatisations -- The tyft/tyxt format reduces to tree rules -- Undecidable equivalences for basic parallel processes -- Normal proofs and their grammar -- A symmetric lambda calculus for ?classical? program extraction -- The ? ?-calculus -- Syntactic definitions of undefined: On defining the undefined -- Discovering needed reductions using type theory -- Nontraditional applications of automata theory -- Abstract pre-orders -- Categorical models of relational databases I: Fibrational formulation, schema integration -- Petri nets, Horn programs, Linear Logic, and vector games -- A complete type inference system for subtyped recursive types -- Subtyping with union types, intersection types and recursive types -- A decidable intersection type system based on relevance -- Temporal verification diagrams -- A semantic theory for Concurrent ML -- Replication in concurrent combinators -- Transitions as interrupts: A new semantics for timed statecharts -- Relating multifunctions and predicate transformers through closure operators -- Notes on typed object-oriented programming -- Observing truly concurrent processes. 330 $aThis volume contains the proceedings of the Second International Symposium on Theoretical Aspects of Computer Science, held at Tohoku University, Japan in April 1994. This top-level international symposium on theoretical computer science is devoted to theoretical aspects of programming, programming languages and system, and parallel and distributed computation. The papers in the volume are grouped into sessions on: lambda calculus and programming; automated deduction; functional programming; objects and assignments; concurrency; term rewriting and process equivalence; type theory and programming; algebra, categories and linear logic; and subtyping, intersection and union types. The volume also includes seven invited talks and two open lectures. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v789 606 $aSoftware engineering 606 $aApplication software 606 $aComputer logic 606 $aProgramming languages (Electronic computers) 606 $aComputer programming 606 $aSoftware Engineering/Programming and Operating Systems$3https://scigraph.springernature.com/ontologies/product-market-codes/I14002 606 $aComputer Applications$3https://scigraph.springernature.com/ontologies/product-market-codes/I23001 606 $aLogics and Meanings of Programs$3https://scigraph.springernature.com/ontologies/product-market-codes/I1603X 606 $aProgramming Languages, Compilers, Interpreters$3https://scigraph.springernature.com/ontologies/product-market-codes/I14037 606 $aSoftware Engineering$3https://scigraph.springernature.com/ontologies/product-market-codes/I14029 606 $aProgramming Techniques$3https://scigraph.springernature.com/ontologies/product-market-codes/I14010 615 0$aSoftware engineering. 615 0$aApplication software. 615 0$aComputer logic. 615 0$aProgramming languages (Electronic computers). 615 0$aComputer programming. 615 14$aSoftware Engineering/Programming and Operating Systems. 615 24$aComputer Applications. 615 24$aLogics and Meanings of Programs. 615 24$aProgramming Languages, Compilers, Interpreters. 615 24$aSoftware Engineering. 615 24$aProgramming Techniques. 676 $a005.1 702 $aHagiya$b Masami$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aMitchell$b John C$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a996466267403316 996 $aTheoretical Aspects of Computer Software$92162365 997 $aUNISA