Theoretical Aspects of Computer Software: Third International Symposium, Tacs'97, Sendai, Japan, September 23 - 26, 1997, Proceedings

ISBN-13: 9783540633884 / Angielski / Miękka / 1997 / 648 str.

Martin Abadi; Takayasu Ito

Opis

These proceedings from the Third International Symposium on Theoretical Aspects of Computer Software, TACS '97, address the following topics: action calculi; polymorphisms; type theory; lambda calculi; refinement; finite transition systems; model checking; process algebras; logical frameworks; and higher-order logics.

Spis treści

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.