Sharp elements and apartness in domains
From MaRDI portal
Publication:6653753
DOI10.4204/eptcs.351.9MaRDI QIDQ6653753
Publication date: 17 December 2024
Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Locatedness and overt sublocales
- A constructive theory of continuous domains suitable for implementation
- Constructivism in mathematics. An introduction. Volume II
- A course in constructive algebra
- LCF considered as a programming language
- A type-theoretical alternative to ISWIM, CUCH, OWHY
- Constructive domain theory as a branch of intuitionistic pointfree topology
- Inductively generated formal topologies.
- A type theoretic interpretation of constructive domain theory
- The constructive maximal point space and partial metrizability
- Formalized, Effective Domain Theory in Coq
- Apartness and Uniformity
- Some Domain Theory and Denotational Semantics in Coq
- Higher-Order Computability
- Exhaustible sets in higher-type computation
- Continuous domains as formal spaces
- Spaces of maximal points
- Continuous Lattices and Domains
- Predicative Aspects of Order Theory in Univalent Foundations
Related Items (1)
This page was built for publication: Sharp elements and apartness in domains