Theoretical Aspects of Computer Software

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 87 Full Abstraction for PCF (extended abstract)
3. Altmetric Badge
   Chapter 88 Fully abstract semantics for concurrent λ-calculus
4. Altmetric Badge
   Chapter 89 An operational approach to combining classical set theory and functional programming languages
5. Altmetric Badge
   Chapter 90 ML typing, explicit polymorphism and qualified types
6. Altmetric Badge
   Chapter 91 Extensions to type systems can preserve operational equivalences
7. Altmetric Badge
   Chapter 92 Constraint programming and database query languages
8. Altmetric Badge
   Chapter 93 Intuitionistic resolution for a logic programming language with scoping constructs
9. Altmetric Badge
   Chapter 94 Proof by pointing
10. Altmetric Badge
    Chapter 95 A computer-checked verification of Milner's scheduler
11. Altmetric Badge
    Chapter 96 A purely functional language with encapsulated assignment
12. Altmetric Badge
    Chapter 97 Simple termination of hierarchical combinations of term rewriting systems
13. Altmetric Badge
    Chapter 98 Separate abstract interpretation for control-flow analysis
14. Altmetric Badge
    Chapter 99 Extensible denotational language specifications
15. Altmetric Badge
    Chapter 100 A normalizing calculus with overloading and subtyping
16. Altmetric Badge
    Chapter 101 A theory of primitive objects
17. Altmetric Badge
    Chapter 102 Programming objects with ML-ART an extension to ML with abstract and record types
18. Altmetric Badge
    Chapter 103 A type system for a lambda calculus with assignments
19. Altmetric Badge
    Chapter 104 Theory and practice of Concurrent Object-Oriented Computing
20. Altmetric Badge
    Chapter 105 The family relation in Interaction Systems
21. Altmetric Badge
    Chapter 106 On syntactic and semantic action refinement
22. Altmetric Badge
    Chapter 107 Locality and true-concurrency in calculi for mobile processes
23. Altmetric Badge
    Chapter 108 Term rewriting properties of SOS axiomatisations
24. Altmetric Badge
    Chapter 109 The tyft/tyxt format reduces to tree rules
25. Altmetric Badge
    Chapter 110 Undecidable equivalences for basic parallel processes
26. Altmetric Badge
    Chapter 111 Normal proofs and their grammar
27. Altmetric Badge
    Chapter 112 A symmetric lambda calculus for “classical” program extraction
28. Altmetric Badge
    Chapter 113 The λ Δ -calculus
29. Altmetric Badge
    Chapter 114 Syntactic definitions of undefined: On defining the undefined
30. Altmetric Badge
    Chapter 115 Discovering needed reductions using type theory
31. Altmetric Badge
    Chapter 116 Nontraditional applications of automata theory
32. Altmetric Badge
    Chapter 117 Abstract pre-orders
33. Altmetric Badge
    Chapter 118 Categorical models of relational databases I: Fibrational formulation, schema integration
34. Altmetric Badge
    Chapter 119 Petri nets, Horn programs, Linear Logic, and vector games
35. Altmetric Badge
    Chapter 120 A complete type inference system for subtyped recursive types
36. Altmetric Badge
    Chapter 121 Subtyping with union types, intersection types and recursive types
37. Altmetric Badge
    Chapter 122 A decidable intersection type system based on relevance
38. Altmetric Badge
    Chapter 123 Temporal verification diagrams
39. Altmetric Badge
    Chapter 124 A semantic theory for Concurrent ML
40. Altmetric Badge
    Chapter 125 Replication in concurrent combinators
41. Altmetric Badge
    Chapter 126 Transitions as interrupts: A new semantics for timed statecharts
42. Altmetric Badge
    Chapter 127 Relating multifunctions and predicate transformers through closure operators
43. Altmetric Badge
    Chapter 128 Notes on typed object-oriented programming
44. Altmetric Badge
    Chapter 129 Observing truly concurrent processes