000 04253nam a22005775i 4500
001 978-3-540-69530-1
003 DE-He213
005 20240423132559.0
007 cr nn 008mamaa
008 121227s1997 gw | s |||| 0|eng d
020 _a9783540695301
_9978-3-540-69530-1
024 7 _a10.1007/BFb0014544
_2doi
050 4 _aQA75.5-76.95
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYA
_2thema
082 0 4 _a004.0151
_223
245 1 0 _aTheoretical Aspects of Computer Software
_h[electronic resource] :
_bThird International Symposium, TACS'97, Sendai, Japan, September 23 - 26, 1997, Proceedings /
_cedited by Martin Abadi, Takayasu Ito.
250 _a1st ed. 1997.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c1997.
300 _aXII, 648 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 ;
_v1281
505 0 _aStrong normalisation in higher-order action calculi -- Extending ML with semi-explicit higher-order polymorphism -- Optimal representations of polymorphic types with subtyping (Extended abstract) -- Cyclic lambda calculi -- Type system for specializing polymorphism -- On strictness and totality -- Sound specialization in the presence of computational effects -- An axiomatic approach to binary logical relations with applications to data refinement -- Infinitary domain logic for finitary transition systems -- Some results in the join-calculus -- Local model checking for value-passing processes (Extended abstract) -- Data refinement of remote procedures -- A type-theoretic approach to deadlock-freedom of asynchronous systems -- Composable semantic models for actor theories -- “Classical” programming-with-proofs in ? Sym PA : An analysis of non-confluence -- Environments, continuation semantics and indexed categories -- Comparing object encodings -- System F with width-subtyping and record updating -- Relational interpretations of recursive types in an operational setting (Summary) -- Extending a logical framework with a modal connective for validity -- Using reflection to build efficient and certified decision procedures -- Sets in types, types in sets -- Combining Petri nets and PA-processes -- Symbolic model-checking method based on approximations and binary decision diagrams for real-time systems -- Types and models for higher-order action calculi -- Finite-state transducers as regular Böhm trees -- Secrecy by typing in security protocols.
520 _aThis book constitutes the refereed proceedings of the Third International Symposium on Theoretical Aspects of Computer Software, TACS'97, held in Sendai, Japan, in September 1997. The book presents 20 revised full papers selected from a total of 46 submissions. Also included are seven invited papers by internationally leading scientists. Among the topics addressed are action calculi, polymorphisms, type theory, lambda calculi, refinement, finite transition systems, model checking, process algebras, logical frameworks, higher-order logics, etc.
650 0 _aComputer science.
650 0 _aSoftware engineering.
650 0 _aMachine theory.
650 1 4 _aTheory of Computation.
650 2 4 _aComputer Science Logic and Foundations of Programming.
650 2 4 _aSoftware Engineering.
650 2 4 _aFormal Languages and Automata Theory.
700 1 _aAbadi, Martin.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aIto, Takayasu.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540633884
776 0 8 _iPrinted edition:
_z9783662184387
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v1281
856 4 0 _uhttps://doi.org/10.1007/BFb0014544
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
912 _aZDB-2-BAE
942 _cSPRINGER
999 _c189345
_d189345