The following pages link to Light linear logic (Q1271560):
Displaying 38 items.
- Controlling Program Extraction in Light Logics (Q3007661) (← links)
- An Elementary Affine λ-Calculus with Multithreading and Side Effects (Q3007663) (← links)
- A Short Introduction to Implicit Computational Complexity (Q3166988) (← links)
- Implementing Cantor’s Paradise (Q3179294) (← links)
- A By-Level Analysis of Multiplicative Exponential Linear Logic (Q3182938) (← links)
- Manipulating Sources of Information: Towards an Interpretation of Linear Logic and Strong Relevance Logic (Q3305423) (← links)
- Parsimonious Types and Non-uniform Computation (Q3449488) (← links)
- On Paths-Based Criteria for Polynomial Time Complexity in Proof-Nets (Q3460508) (← links)
- A Characterization of NC k by First Order Functional Programs (Q3502640) (← links)
- Recursion Schemata for NC k (Q3540170) (← links)
- Taming Modal Impredicativity: Superlazy Reduction (Q3605525) (← links)
- Light Linear Logic with Controlled Weakening (Q3605533) (← links)
- Some Complexity and Expressiveness Results on Multimodal and Stratified Proof Nets (Q3638260) (← links)
- An analysis of (linear) exponentials based on extended sequents (Q4221772) (← links)
- A new “feasible” arithmetic (Q4532603) (← links)
- Jump from parallel to sequential proofs: exponentials (Q4577985) (← links)
- POLYMORPHISM AND THE OBSTINATE CIRCULARITY OF SECOND ORDER LOGIC: A VICTIMS’ TALE (Q4637941) (← links)
- Plugging-in proof development environments using<i>Locks</i>in<tt>LF</tt> (Q4691186) (← links)
- (Q5079730) (← links)
- (Q5092325) (← links)
- (Q5094117) (← links)
- Is the Optimal Implementation Inefficient? Elementarily Not (Q5111313) (← links)
- Encodings of Turing machines in linear logic (Q5139286) (← links)
- Cofree coalgebras and differential linear logic (Q5139287) (← links)
- MODAL LOGIC WITHOUT CONTRACTION IN A METATHEORY WITHOUT CONTRACTION (Q5216977) (← links)
- Proof-Theoretic Semantics and Feasibility (Q5250217) (← links)
- Proofs, Reasoning and the Metamorphosis of Logic (Q5251186) (← links)
- Implicit computation complexity in higher-order programming languages (Q5875893) (← links)
- Linear Logic Properly Displayed (Q5886520) (← links)
- A linear logic framework for multimodal logics (Q5889307) (← links)
- Theoretical Computer Science (Q5897348) (← links)
- Bounded Linear Logic, Revisited (Q5902142) (← links)
- Read/write factorizable programs (Q6113488) (← links)
- Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic (Q6137846) (← links)
- Theoretical computer science: computational complexity (Q6602263) (← links)
- Exponentials as substitutions and the cost of cut elimination in linear logic (Q6649484) (← links)
- Exponentially handsome proof nets and their normalization (Q6657781) (← links)
- Super exponentials in linear logic (Q6657784) (← links)
