coq-club AT inria.fr
Subject: The Coq mailing list
List archive
- From: Eddy Westbrook <westbrook AT galois.com>
- To: coq-club AT inria.fr
- Subject: [Coq-Club] Representable Functions and Representably-Complete Partial Orders
- Date: Mon, 7 May 2018 11:57:59 -0700
- Authentication-results: mail3-smtp-sop.national.inria.fr; spf=None smtp.pra=westbrook AT galois.com; spf=Pass smtp.mailfrom=westbrook AT galois.com; spf=None smtp.helo=postmaster AT mail-pl0-f54.google.com
- Ironport-phdr: 9a23:ouH9+R1VyulnjYiHsmDT+DRfVm0co7zxezQtwd8Zse0UL/ad9pjvdHbS+e9qxAeQG9mDsLQc06L/iOPJYSQ4+5GPsXQPItRndiQuroEopTEmG9OPEkbhLfTnPGQQFcVGU0J5rTngaRAGUMnxaEfPrXKs8DUcBgvwNRZvJuTyB4Xek9m72/q99pHPbQhEniaxba9vJxiqsAvdsdUbj5F/Iagr0BvJpXVIe+VSxWx2IF+Yggjx6MSt8pN96ipco/0u+dJOXqX8ZKQ4UKdXDC86PGAv5c3krgfMQA2S7XYBSGoWkx5IAw/Y7BHmW5r6ryX3uvZh1CScIMb7S60/Vza/4KdxUBLmiDsIOTEk/m/UhMJ+kq1UrhW6qhxj2o7UZZ2ZNPpicq7fe94RWGpPXtxWVyxEGo6yYJYAAPcBPO1Fr4byuUAOrQelCgm2A+PvzTxIjWLx0Kw0zeshCh3G0xc6H9IJt3TUr874NKgIXuCxy6nIzC7DY+lK1jf67YjFaxYsquyPU7Joacfd11UjGgffgliTqYHpJS6Z2+URv2SB7+dtWvqjh3Aopg1rvDSj2N0gh4vHi44P1FzI6Tt1zYAoLtOiUkF7e8SrEJ5IuiGaKYR2RsQiTnltuCkgy70GvYe3fDAOyJg73hLfZfyKfoeS7hLsU+aRJjh4hHZ7d76lmxmy9k2gxvX9VsmyzllKsjJInsfQun0JzRDe6ciKRuFg8kqgxTqDzQDe5+5cLUAxj6XbKpohwrAqlpoUtETOBiH3l1vtjK+KbUok4O+o6+PkYrj9qZ+TLYt0igb/MqQ1gMCwHeM4Mg0WU2iB5eu8zKHj/VH+QLhSkvI2lbDZvInGKsQfu662GBRY0p0j6ha6Fzepys4UnXgBLFJfeRKIlZLlO1/UIKOwMfDqiFO11Txv2vruP7v7A5yLIGKQvq3meONQ50JNgDU+1sxV/ZVTCflVP//oRkXrs9vbJhAwNwu12KDsD9ArhdBWYn6GHqLMaPCailSP/O96e7DdNr9Qgy70Lr0e39CriHY4nVEHeqzwh8kYYXS/H+8gKEKcMyO13oUxVFwStw97d9TEzUWYWGcJNXm7W6U9/XcwD4f0Vd6eFLDou6SI2WKAJrMTZm1CDQrRQ3LhdoHBQ/NULSzPfolulTsLUbXnQIgkh0mj
Hi Coq Club,
I was wondering if anyone could point me to some related work for some
semantics work I am doing.
I am trying to build a denotational semantics using a category of
representable functions, where a "representable function” is any function
that is definable using a fixed set of function-building operations. These
operations might include composition, the identity function, certain constant
functions, etc.
In order to define recursion and fixed-points, I need to use a twist on the
standard machinery of complete partial orders (CPOs), because not every
ascending chain of representable functions is guaranteed to have a supremum
that is itself representable. This can be shown by a cardinality argument,
since we have only countably many representable functions but uncountably
many ascending chains of functions in, say, the function space Nat -> _|_ +
Unit. (This co-domain is my ASCII way of writing the Sierpinski space.)
So, instead, my idea is that my domains only need to be complete for
representable chains, that is, chains that can be constructed by repeated
applications of representable functions. More specifically, my chains look
like this:
proj init <= proj (f init) <= proj (f (f init)) <= …
for a given starting point init : A, a representable function f : A -> A, and
a projection function proj : A -> B, such that the functions f and proj are
both Scott-continuous (monotone and preserve suprema, when they exist), and
such that init <= f init. I am calling this concept a “representably-complete
partial order” because the partial order only has to be complete for
representable chains.
My question is: does anybody know any work that is related to this? The idea
of using representable functions is certainly not new, and has been used for
decades (almost a century!) in computability theory. But I have not seen any
work that talks about doing domain theory on representable functions, and
would really appreciate any pointers into the literature on it.
Thanks Coq Club!
-Eddy
- [Coq-Club] Representable Functions and Representably-Complete Partial Orders, Eddy Westbrook, 05/07/2018
- Re: [Coq-Club] Representable Functions and Representably-Complete Partial Orders, Max New, 05/08/2018
Archive powered by MHonArc 2.6.18.