E-Books durchsuchen
Mathematical Foundations of Programming Semantics [1994]
- 1
-
Final universes of processes
- 29
-
On the symmetry of sequentiality
- 72
-
Computational adequacy via ‘mixed’ inductive definitions
- 83
-
A structural co-induction theorem
- 103
-
Three metric domains of processes for bisimulation
- 122
-
Topological models for higher order control flow
- 143
-
An investigation into functions as processes
- 160
-
Time abstracted bisimulation: Implicit specifications and decidability
- 177
-
Timewise refinement for communicating processes
- 215
-
Axiomatising real-timed processes
- 230
-
A predicative semantics for the refinement of real-time systems
- 250
-
Compositional process semantics of Petri Boxes
- 271
-
On the specification of elementary reactive behaviour
- 293
-
A chemical abstract machine for graph reduction extended abstract
- 304
-
Lifting theorems for Kleisli categories
- 320
-
Sequential functions on indexed domains and full abstraction for a sub-language of PCF
- 333
-
Another approach to sequentiality: Kleene's unimonotone functions
- 359
-
Mechanizing logical relations
- 378
-
Some quasi-varieties of iteration theories
- 410
-
Probabilistic power domains, information systems, and locales
- 438
-
Linear domains and linear maps
- 454
-
Universal quasi-prime algebraic domains
- 474
-
Holomorphic models of exponential types in linear logic
- 513
-
A syntax for linear logic
- 530
-
A complete axiomatisation for trace congruence of finite state behaviors
- 544
-
The asymmetric topology of computer science
- 554
-
Ultimately periodic words of rational <Emphasis Type="Italic">ω</Emphasis>-languages
- 567
-
Category of Δ-functors
- 587
-
A categorical interpretation of Landin's correspondence principle
- 603
-
An operational semantics for TOOPLE: A statically-typed object-oriented programming language
- 627
-
On the transformation between direct and continuation semantics