Domain theory in logical form* * This work was financially supported by the U.K. Science and Engineering Research Council and the Alvey Programme.

Annals of Pure and Applied Logic

Volumn 51, Issue 1-2, 1991, Pages 1-77

  Abramsky, Samson ^a  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 19144373216     PISSN: 01680072     EISSN: None     Source Type: Journal    
DOI: 10.1016/0168-0072(91)90065-T     Document Type: Article

References (90)

1. Semantic foundations for applicative multiprogramming
2. Domain theory and the logic of observable properties
3. A domain equation for bisimulation
4. Domain theory and the logic of observable properties
5. Domain theory in logical form
6. The lazy λ-calculus
7. Domain theory and the logix of observable properties
8. An introduction to inductive definitions
9. The Lambda Calculus: Its Syntax and Semantics
10. A filter lambda model and the completeness of type-assignment
11. An introduction to first order logic
12. Theory and practice of sequential algorithms: the kernel of the applicative language CDS
13. Full abstraction for sequential languages: the state of the art
14. Model Theory
15. Extended type structure and filter lambda models
16. Principal type schemes for functional programs
17. Processes and the denotational semantics of concurrency
18. Computability concepts for programming language semantics
19. Computable functionals of finite types
20. Linear Logic
21. A logic for the specification and proof of regular controllable processes of CCS
22. Profinite solutions for recursive domain equations
23. The largest first-order axiomatizable cartesian closed category of domains
24. Universal profinite domains
25. First Order Dynamic Logic
26. Algebraic laws for non-determinism and concurrency
27. Full abstraction for a simple parallel programming language
28. An axiomatic basis for computer programming
29. Function spaces in the category of locales
30. Stone Spaces
31. Vietoris locales and localic semi-lattices
32. Fully effective solutions of recursive domain equations
33. Fully effective solutions of recursive domain equations
34. A representation theorem for models of ★-free PDL
35. On the duality of dynamic algebras and Kripke models
36. A probabilistic PDL
37. Interpretation of analysis by means of functionals of finite type
38. Introduction to Higher Order Categorial Logic
39. Using information systems to solve recursive domain equations effectively
40. Metric spaces, generalized logic, and closed categories
41. Lecture notes on the domain interpretation of type theory
42. Metric domains for completeness
43. Fully abstract models of typed λ-calculi
44. A Calculus for Communicating Systems
45. Calculi for synchrony and asynchrony
46. Abstract interpretation and optimising transformations for applicative programs
47. Abstract interpretation using domain theory
48. Infinite words, infinite trees, infinite computations
49. Type categories, functor categories and block structure
50. A powerdomain construction
51. LCF considered as a programming language
52. A powerdomain for countable non-determinism
53. A metalanguage for predomains
54. Lectures on predomains and partial functions
55. A framework for intuitionistic modal logics (extended abstract)
56. The temporal logic of programs
57. On specifications theories and models with higher types
58. Foundations are rich institutions, but institutions are poor foundations
59. Dynamic Logic
60. Logical aspects of denotational semantics
61. Outline of a mathematical theory of computation
62. Data types as lattices
63. Lambda calculus: Some models, some philosophy
64. Lectures on a mathematical theory of computation
65. Domains for denotational semantics
66. Effectively given domains
67. The largest cartesian closed category of domains
68. Powerdomains and predicate transformers: a topological view
69. The category-theoretic solution of recursive domain equations
70. Recursively Enumerable Sets and Degrees
71. Modal logics for communicating systems
72. The theory of representations for Boolean algebras
73. USCC
74. Topology Via Logic
75. Events in Computation
76. A complete proof system for SCCS with modal assertions