Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.
You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.
After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.
digitally watermarked, no DRM
The eBook version of this title will be available soon
This 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.
Content Level »Research
Keywords »action calculi - calculus - lambda calculus - logic - model checking - object - polymorphism - program refinement - program semantics - programming - real-time - security - semantics - sets - type theory
Strong 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.