Encoding Hamiltonian circuits into multiplicative linear logic
نویسندگان
چکیده
منابع مشابه
Embedding intersection types into multiplicative linear logic
Intersection types characterize properties on lambda-terms such as head, weak and strong normalization. One can establish relations between intuitionistic logic and intersection types with idempotence. Here we consider a type system without idempotence and we underline common traits with intuitionistic multiplicative linear logic. We analyse head normalization to try and get properties such as ...
متن کاملOn Multiplicative Linear Logic, Modality and Quantum Circuits
A logical system derived from linear logic and called QMLL is introduced and shown able to capture all unitary quantum circuits. Conversely, any proof is shown to compute, through a concrete GoI interpretation, some quantum circuits. The system QMLL, which enjoys cut-elimination, is obtained by endowing multiplicative linear logic with a quantum modality.
متن کاملProof diagrams for multiplicative linear logic
The original idea of proof nets can be formulated by means of interaction nets syntax. Additional machinery as switching, jumps and graph connectivity is needed in order to ensure correspondence between a proof structure and a correct proof in sequent calculus. In this paper we give an interpretation of proof nets in the syntax of string diagrams. Even though we lose standard proof equivalence,...
متن کاملMultiplicative Linear Logic for Resource Transformation Nets
In this paper we introduce a new type of nets with distributed resources : resource transformation nets (RT-nets). A new calculus based on Horn fragment of Multi-pllcatlve Linear Logic is proposed for this class of models. Theorem of completness is proved.
متن کاملProof nets sequentialisation in multiplicative linear logic
We provide an alternative proof of the sequentialisation theorem for proof nets of multiplicative linear logic. Namely, we show how a proof net can be transformed into a sequent calculus proof simply by properly adding to it some special edges, called sequential edges, which express the sequentiality constraints given by sequent calculus. © 2008 Elsevier B.V. All rights reserved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2001
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(00)00381-9