Mathematical Foundations of Computer Science 1993

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 1 On the unification free prolog programs
3. Altmetric Badge
   Chapter 2 Equivalences and preorders of transition systems
4. Altmetric Badge
   Chapter 3 Deliverables: a categorical approach to program development in type theory
5. Altmetric Badge
   Chapter 4 Complex and complex-like traces
6. Altmetric Badge
   Chapter 5 Symbolic bisimulations (abstract)
7. Altmetric Badge
   Chapter 6 Some results on the full abstraction problem for restricted lambda calculi
8. Altmetric Badge
   Chapter 7 Action calculi, or syntactic action structures
9. Altmetric Badge
   Chapter 8 Mathematical Foundations of Computer Science 1993
10. Altmetric Badge
    Chapter 9 The second calculus of binary relations
11. Altmetric Badge
    Chapter 10 An introduction to dynamic labeled 2-structures
12. Altmetric Badge
    Chapter 11 Post Correspondence Problem: Primitivity and interrelations with complexity classes
13. Altmetric Badge
    Chapter 12 A taste of linear logic
14. Altmetric Badge
    Chapter 13 On the tree inclusion problem
15. Altmetric Badge
    Chapter 14 On the adequacy of per models
16. Altmetric Badge
    Chapter 15 Hausdorff reductions to sparse sets and to sets of high information content
17. Altmetric Badge
    Chapter 16 Stores as homomorphisms and their transformations
18. Altmetric Badge
    Chapter 17 Comparative semantics for linear arrays of communicating processes
19. Altmetric Badge
    Chapter 18 Rabin tree automata and finite monoids
20. Altmetric Badge
    Chapter 19 Efficient type reconstruction in the presence of inheritance
21. Altmetric Badge
    Chapter 20 A characterization of Sturmian morphisms
22. Altmetric Badge
    Chapter 21 On the complexity of scheduling incompatible jobs with unit-times
23. Altmetric Badge
    Chapter 22 Isomorphisms between predicate and state transformers
24. Altmetric Badge
    Chapter 23 On the amount of nondeterminism and the power of verifying
25. Altmetric Badge
    Chapter 24 Observing distribution in processes
26. Altmetric Badge
    Chapter 25 Speedup of recognizable trace languages
27. Altmetric Badge
    Chapter 26 May I borrow your logic?
28. Altmetric Badge
    Chapter 27 Approximate and exact deterministic parallel selection
29. Altmetric Badge
    Chapter 28 Defining soft sortedness by abstract interpretation
30. Altmetric Badge
    Chapter 29 A model for real-time process algebras (extended abstract)
31. Altmetric Badge
    Chapter 30 Data encapsulation and modularity: Three views of inheritance
32. Altmetric Badge
    Chapter 31 Image compression using Weighted Finite Automata
33. Altmetric Badge
    Chapter 32 Filter models for a parallel and non deterministic λ-calculus
34. Altmetric Badge
    Chapter 33 Real number computability and domain theory
35. Altmetric Badge
    Chapter 34 Lambda substitution algebras
36. Altmetric Badge
    Chapter 35 Global properties of 2D cellular automata: some complexity results
37. Altmetric Badge
    Chapter 36 Mathematical Foundations of Computer Science 1993
38. Altmetric Badge
    Chapter 37 An expressive logic for Basic Process Algebra
39. Altmetric Badge
    Chapter 38 The complexity of finding replicas using equality tests
40. Altmetric Badge
    Chapter 39 A complete axiomatization for branching bisimulation congruence of finite-state behaviours
41. Altmetric Badge
    Chapter 40 Object Oriented application flow graphs and their semantics
42. Altmetric Badge
    Chapter 41 Some hierarchies for the communication complexity measures of cooperating grammar systems
43. Altmetric Badge
    Chapter 42 Efficient parallel graph algorithms based on open ear decomposition
44. Altmetric Badge
    Chapter 43 On the communication complexity of parallel computation
45. Altmetric Badge
    Chapter 44 A taxonomy of forgetting automata
46. Altmetric Badge
    Chapter 45 Hybrid parallel programming and implementation of synchronised communication
47. Altmetric Badge
    Chapter 46 Proof systems for cause based equivalences
48. Altmetric Badge
    Chapter 47 A uniform universal CREW PRAM
49. Altmetric Badge
    Chapter 48 Observing located concurrency
50. Altmetric Badge
    Chapter 49 The boundary of substitution systems
51. Altmetric Badge
    Chapter 50 New algorithms for detecting morphic images of a word
52. Altmetric Badge
    Chapter 51 Ignoring nonessential interleavings in assertional reasoning on concurrent programs
53. Altmetric Badge
    Chapter 52 Constant time reductions in λ-calculus
54. Altmetric Badge
    Chapter 53 Heterogeneous unified algebras
55. Altmetric Badge
    Chapter 54 A representation theorem for lambda abstraction algebras
56. Altmetric Badge
    Chapter 55 On saturated calculi for a linear temporal logic
57. Altmetric Badge
    Chapter 56 The snack powerdomain for database semantics
58. Altmetric Badge
    Chapter 57 Verifying properties of module construction in type theory
59. Altmetric Badge
    Chapter 58 On time-space trade-offs in dynamic graph pebbling
60. Altmetric Badge
    Chapter 59 Mathematical Foundations of Computer Science 1993
61. Altmetric Badge
    Chapter 60 Real-time refinement: Semantics and application
62. Altmetric Badge
    Chapter 61 Deciding testing equivalence for real-time processes with dense time
63. Altmetric Badge
    Chapter 62 A calculus for higher order procedures with global variables
64. Altmetric Badge
    Chapter 63 Variable substitution with iconic combinators
65. Altmetric Badge
    Chapter 64 Feature constraints with first-class features
66. Altmetric Badge
    Chapter 65 Between Min Cut and Graph Bisection
67. Altmetric Badge
    Chapter 66 Paths and cycles in finite periodic graphs
68. Altmetric Badge
    Chapter 67 Learning decision lists from noisy examples
69. Altmetric Badge
    Chapter 68 Analytic tableaux for finite and infinite Post logics