Pages that link to "Item:Q685430"

The following pages link to Computational interpretations of linear logic (Q685430):

Displaying 50 items.

• 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 \(\lambda\)-calculus based on linear chemical abstract machine (Q2841304) (← links)
• The linear logical abstract machine (Q2851319) (← links)
• A concurrent model for linear logic (Q2852348) (← links)
• A calculus for interaction nets based on the linear chemical abstract machine (Q2864502) (← links)
• The power of closed reduction strategies (Q2866800) (← links)
• Propositions as sessions (Q2875234) (← links)
• (Q2980972) (← links)
• Observed Communication Semantics for Classical Processes (Q2988633) (← links)
• (Q3070759) (← links)
• Intersection Types for the Resource Control Lambda Calculi (Q3105748) (← links)
• Behavioural Analysis of Sessions Using the Calculus of Structures (Q3179170) (← links)
• Cathoristic Logic (Q3297837) (← links)
• THE JUDGEMENT CALCULUS FOR INTUITIONISTIC LINEAR LOGIC: PROOF THEORY AND SEMANTICS (Q3363460) (← links)
• Coordination: Reo, Nets, and Logic (Q3603000) (← links)
• (Q4028123) (← links)
• Contraction-free sequent calculi for intuitionistic logic (Q4032862) (← links)
• The Logic of Bunched Implications (Q4262604) (← links)
• The mix rule (Q4302338) (← links)
• Games and full completeness for multiplicative linear logic (Q4302352) (← links)
• Local computation in linear logic (Q4304131) (← links)
• Linear Logic as CSP (Q4305350) (← links)
• Applications of Linear Logic to Computation: An Overview (Q4318165) (← links)
• A new “feasible” arithmetic (Q4532603) (← links)
• Affine sessions (Q4558783) (← links)
• An introduction to differential linear logic: proof-nets, models and antiderivatives (Q4577980) (← links)
• The true concurrency of differential interaction nets (Q4577982) (← links)
• Paraconsistent constructive logic with strong negation as a contraction-free relevant logic (Q4586423) (← links)
• Three faces of natural deduction (Q4610312) (← links)
• Linear Logics with Communication-merge (Q4673354) (← links)
• Lilac: a functional programming language based on linear logic (Q4764609) (← links)
• (Q4842971) (← links)
• Reference counting as a computational interpretation of linear logic (Q4895551) (← links)
• Operational Properties of Lily, a Polymorphic Linear Lambda Calculus with Recursion (Q4921510) (← links)
• (Q4989404) (← links)
• (Q5015212) (← links)
• (Q5018484) (← links)
• Typing Quantum Superpositions and Measurement (Q5055990) (← links)
• (Q5089276) (← links)
• RELEVANCE FOR THE CLASSICAL LOGICIAN (Q5107541) (← links)
• Linear logic propositions as session types (Q5741566) (← links)
• (Q5875401) (← links)
• Focused linear logic and the \(\lambda\)-calculus (Q5971394) (← links)
• Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic (Q6137846) (← links)
• A concrete model for a typed linear algebraic lambda calculus (Q6149958) (← links)
• Safe session-based concurrency with shared linear state (Q6535247) (← links)
• Reductive logic, proof-search, and coalgebra: a perspective from resource semantics (Q6612799) (← links)
• Semantics for a lambda calculus for string diagrams (Q6612802) (← links)