Pages that link to "Item:Q685430"
From MaRDI portal
The following pages link to Computational interpretations of linear logic (Q685430):
Displaying 50 items.
- On the largest Cartesian closed category of stable domains. (Q276408) (← links)
- Visible acyclic differential nets. I: Semantics (Q409321) (← links)
- Quantum-like logics and schizophrenia (Q420845) (← links)
- Linear logical relations and observational equivalences for session-based concurrency (Q476190) (← links)
- On the largest Cartesian closed category of stable domains (Q517047) (← links)
- Strong normalisation in the \(\pi\)-calculus (Q598201) (← links)
- Linearity and iterator types for Gödel's system \(\mathcal T\) (Q656851) (← links)
- Computational interpretations of linear logic (Q685430) (← links)
- Resource operators for \(\lambda\)-calculus (Q876041) (← links)
- Foundation for quantum computing. II (Q884804) (← links)
- The logic of message-passing (Q923880) (← links)
- Gödel's system \(\mathcal T\) revisited (Q960861) (← links)
- An exact correspondence between a typed pi-calculus and polarised proof-nets (Q974114) (← links)
- Plans, actions and dialogues using linear logic (Q1016033) (← links)
- Bounded linear logic: A modular approach to polynomial-time computability (Q1193854) (← links)
- Constructive logics. I: A tutorial on proof systems and typed \(\lambda\)- calculi (Q1208732) (← links)
- Linearizing intuitionistic implication (Q1210141) (← links)
- Reaction graph (Q1273068) (← links)
- An internal language for autonomous categories (Q1320337) (← links)
- The complexity of Horn fragments of linear logic (Q1337693) (← links)
- Proofs as processes (Q1342245) (← links)
- On the \(\pi\)-calculus and linear logic (Q1342247) (← links)
- On proof normalization in linear logic (Q1342248) (← links)
- Constant-only multiplicative linear logic is NP-complete (Q1342254) (← links)
- New Curry-Howard terms for full linear logic (Q1390952) (← links)
- A general adequacy result for a linear functional language (Q1391860) (← links)
- A linear logical framework (Q1400718) (← links)
- Domain theory for concurrency (Q1434357) (← links)
- Proof nets, garbage, and computations (Q1589650) (← links)
- Lewis meets Brouwer: constructive strict implication (Q1688950) (← links)
- A partial solution to an open problem of Amadio and Curien (Q1753999) (← links)
- Structural cut elimination. I: Intuitionistic and classical logic (Q1854335) (← links)
- Pattern matching as cut elimination (Q1882898) (← links)
- Natural deduction for intuitionistic linear logic (Q1891252) (← links)
- Asynchronous communication model based on linear logic (Q1898813) (← links)
- Petri nets, Horn programs, linear logic and vector games (Q1899147) (← links)
- Linear logic automata (Q1919766) (← links)
- Human rationality challenges universal logic (Q1931349) (← links)
- Variations on mobile processes (Q1960530) (← links)
- A specification structure for deadlock-freedom of synchronous processes (Q1960536) (← links)
- On the concurrent computational content of intermediate logics (Q1989344) (← links)
- A concrete categorical semantics of lambda-\(\mathcal{S}\) (Q2333669) (← links)
- Session typing and asynchronous subtyping for the higher-order \(\pi\)-calculus (Q2343135) (← links)
- A type-driven vector semantics for ellipsis with anaphora using Lambek calculus with limited contraction (Q2425336) (← links)
- On the unity of duality (Q2482843) (← links)
- Cartesian closed stable categories (Q2486008) (← links)
- Connectionist computations of intuitionistic reasoning (Q2503271) (← links)
- Weak linearization of the lambda calculus (Q2566028) (← links)
- Genericity and the \(\pi\)-calculus (Q2576663) (← links)
- An implementation model of the typed λ-calculus based on Linear Chemical Abstract Machine (Q2841304) (← links)
