• Uniqueness logic

Treffer: Uniqueness logic

Title:
Uniqueness logic
Authors:
HARRINGTON, Dana
Source:
Algebraic methods in language processingTheoretical computer science. 354(1):24-41
Publisher Information:
Amsterdam: Elsevier, 2006.
Publication Year:
2006
Physical Description:
print, 18 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences et techniques communes, Sciences and techniques of general use, Mathematiques, Mathematics, Logique mathématique, fondements, théorie des ensembles, Mathematical logic, foundations, set theory, Logique et fondements, Logic and foundations, Logique générale, General logic, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Théorie programmation, Programming theory, Logiciel, Software, Langages de programmation, Programming languages, Equivalence, Equivalencia, Informatique théorique, Computer theory, Informática teórica, Langage programmation, Programming language, Lenguaje programación, Logique intuitionniste, Intuitionistic logic, Lógica intuicionista, Logique linéaire, Linear logic, Lógica lineal, Programmation fonctionnelle, Functional programming, Programación funcional, Structure donnée, Data structure, Estructura datos, Sémantique, Semantics, Semántica, Théorie catégorie, Category theory, Teoría categoría, Théorie modèles, Model theory, Teoría modelos, Théorie preuve, Proof theory, Teoría demonstración, Système types, Type systems
Document Type:
Konferenz Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Department of Computer Science, University of Calgary, Canada
ISSN:
0304-3975
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=17607699
Rights:
Copyright 2006 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems

Mathematics
Accession Number:
edscal.17607699
Database:
PASCAL Archive

Weitere Informationen

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 o 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.