Formalized, effective domain theory in Coq

DOI10.1007/978-3-319-08970-6_14zbMATH Open1416.68158OpenAlexW199262333MaRDI QIDQ2879253FDOQ2879253

Authors: Robert Dockins 

Publication date: 8 September 2014

Published in: Interactive Theorem Proving (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-08970-6_14

Recommendations

• Some Domain Theory and Denotational Semantics in Coq
• A co-induction principle for recursively defined domains
• Constructive domains with classical witnesses
• scientific article; zbMATH DE number 1005001
• Formalizing synthetic domain theory. The basic definitions

Mathematics Subject Classification ID

Continuous lattices and posets, applications (06B35)

Cited In (13)

• Mac Lane's comparison theorem for the Kleisli construction formalized in Coq
• Denotational semantics of recursive types in synthetic guarded domain theory
• Integration of multiple formal matrix models in Coq
• Some Domain Theory and Denotational Semantics in Coq
• A Purely Definitional Universal Domain
• Apartness, sharp elements, and the Scott topology of domains
• Title not available (Why is that?)
• Mathematical Knowledge Management
• Title not available (Why is that?)
• Sharp elements and apartness in domains
• Two guarded recursive powerdomains for applicative simulation
• ModuRes: a Coq library for modular reasoning about concurrent higher-order imperative programming languages
• Encoding natural semantics in Coq

Uses Software

• Coq

This page was built for publication: Formalized, effective domain theory in Coq

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2879253)