Theoretical Aspects of Computer Software
Editat de Martin Abadi, Takayasu Itoen Limba Engleză Paperback – 27 aug 1997
Preț: 640.33 lei
Preț vechi: 800.41 lei
-20% Nou
Puncte Express: 960
Preț estimativ în valută:
113.31€ • 132.14$ • 99.49£
113.31€ • 132.14$ • 99.49£
Carte tipărită la comandă
Livrare economică 15-29 ianuarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540633884
ISBN-10: 354063388X
Pagini: 660
Ilustrații: XII, 648 p.
Dimensiuni: 155 x 235 x 36 mm
Greutate: 0.98 kg
Ediția:1997
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 354063388X
Pagini: 660
Ilustrații: XII, 648 p.
Dimensiuni: 155 x 235 x 36 mm
Greutate: 0.98 kg
Ediția:1997
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
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.