Abstract
Motivated by a desire to treat non-termination directly in the semantics of computation, the notion of approximation between programs is studied in the context of categories of partial maps. In particular, contextual approximation and specialisation are considered and shown to coincide. Moreover, after exhibiting the approximation between total maps as a primitive notion, from an arbitrary (or axiomatic) approximation order on total maps a computationally natural approximation order on partial maps is derived. The main technical contribution is a characterisation of when this approximation order between partial maps is domain-theoretic (in the sense that the category of partial maps Cpo-enriches) provided that the approximation order between total maps is also.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.