Topology via logic
Programming from specifications
Programming from specifications
Information systems for continuous posets
Theoretical Computer Science
New foundations for fixpoint computations: FIX-hyperdoctrines and the FIX-logic
Information and Computation - Special issue: Selections from 1990 IEEE symposium on logic in computer science
Reasoned programming
Topology via constructive logic
Logic, language and computation, vol. 2
Geometric Logic in Computer Science
Proceedings of the First Imperial College Department of Computing Workshop on Theory and Formal Methods
Localic sup-lattices and tropological systems
Theoretical Computer Science - Topology in computer science
Strongly algebraic = SFP (topically)
Mathematical Structures in Computer Science
Entailment systems for stably locally compact locales
Theoretical Computer Science - Logic, semantics and theory of programming
A universal characterization of the double powerlocale
Theoretical Computer Science - Logic, semantics and theory of programming
The Bicategory-Theoretic Solution of Recursive Domain Equations
Electronic Notes in Theoretical Computer Science (ENTCS)
Strongly algebraic = SFP (topically)
Mathematical Structures in Computer Science
Fuzzy sets and geometric logic
Fuzzy Sets and Systems
| Hi-index | 0.00 |
This paper shows how it is possible to express many techniques of categorical domain theory in the general context of topical categories (where ‘topical’ means internal in the category Top of Grothendieck toposes with geometric morphisms). The underlying topos machinery is hidden by using a geometric form of constructive mathematics, which enables toposes as ‘generalized topological spaces’ to be treated in a transparently spatial way, and also shows the constructivity of the arguments. The theory of strongly algebraic (SFP) domains is given as a case study in which the topical category is Cartesian closed.