Abstract
A uniqueness type system is used to distinguish values which are referenced at most once from values which may be referenced an arbitrary number of times in a program. Uniqueness type systems are used in the Clean and Mercury programming languages to provide efficiently updatable data-structures and I/O without compromising referential transparency. In this paper we establish a Curry–Howard–Lambek equivalence between a form of uniqueness types and a ‘resource-sensitive’ logic. This logic is similar to intuitionistic linear logic, however the ∘ modality, which moderates the structural rules in the antecedent in the same way as ! , is introduced via the dual ? rules. We discuss the categorical proof theory and models of this new logic, as well as its computational interpretation.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
