000 | 04076nam a22005535i 4500 | ||
---|---|---|---|
001 | 978-3-540-69530-1 | ||
003 | DE-He213 | ||
005 | 20160624102057.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 | _aQA76.9.L63 | |
050 | 4 | _aQA76.5913 | |
050 | 4 | _aQA76.63 | |
072 | 7 |
_aUM _2bicssc |
|
072 | 7 |
_aUYF _2bicssc |
|
072 | 7 |
_aCOM051000 _2bisacsh |
|
072 | 7 |
_aCOM036000 _2bisacsh |
|
082 | 0 | 4 |
_a005.1015113 _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 Martín Abadi, Takayasu Ito. |
260 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1997. |
|
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _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, _x0302-9743 ; _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 | _aLogic design. | |
650 | 1 | 4 | _aComputer Science. |
650 | 2 | 4 | _aLogics and Meanings of Programs. |
650 | 2 | 4 | _aSoftware Engineering/Programming and Operating Systems. |
650 | 2 | 4 | _aMathematical Logic and Formal Languages. |
700 | 1 |
_aAbadi, Martín. _eeditor. |
|
700 | 1 |
_aIto, Takayasu. _eeditor. |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer eBooks | |
776 | 0 | 8 |
_iPrinted edition: _z9783540633884 |
786 | _dSpringer | ||
830 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v1281 |
|
856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/BFb0014544 |
942 |
_2EBK7242 _cEBK |
||
999 |
_c36536 _d36536 |