Finitary-based Domain Theory in Coq: An Early Report
Logic in Computer Science
2018-01-26 v1 Programming Languages
Abstract
In domain theory every finite computable object can be represented by a single mathematical object instead of a set of objects, using the notion of finitary-basis. In this article we report on our effort to formalize domain theory in Coq in terms of finitary-basis.
Cite
@article{arxiv.1801.08441,
title = {Finitary-based Domain Theory in Coq: An Early Report},
author = {Moez A. AbdelGawad},
journal= {arXiv preprint arXiv:1801.08441},
year = {2018}
}
Comments
13 pages