The following pages link to Light linear logic (Q1271560):
Displaying 50 items.
- Two function algebras defining functions in \(\mathsf{NC}^k\) Boolean circuits (Q276257) (← links)
- The role of polymorphism in the characterisation of complexity by soft types (Q276263) (← links)
- A type assignment for \(\lambda\)-calculus complete both for FPTIME and strong normalization (Q276268) (← links)
- Bounded combinatory logic and lower complexity (Q276270) (← links)
- Light linear logics with controlled weakening: expressibility, confluent strong normalization (Q408540) (← links)
- Preface to the special volume (Q534064) (← links)
- A semantic measure of the execution time in linear logic (Q534698) (← links)
- Realizability models and implicit complexity (Q534712) (← links)
- Phase semantics and decidability of elementary affine logic (Q596037) (← links)
- Light logics and optimal reduction: completeness and complexity (Q627123) (← links)
- Introduction to clarithmetic. I (Q642523) (← links)
- Type inference for light affine logic via constraints on words (Q703485) (← links)
- Stability and paradox in algorithmic logic (Q861519) (← links)
- Light affine lambda calculus and polynomial time strong normalization (Q877259) (← links)
- Soft linear set theory (Q941435) (← links)
- Gödel's system \(\mathcal T\) revisited (Q960861) (← links)
- A semantic proof of polytime soundness of light affine logic (Q987375) (← links)
- Light types for polynomial time computation in lambda calculus (Q1004289) (← links)
- Quantum implicit computational complexity (Q1044836) (← links)
- Linear logic by levels and bounded time complexity (Q1044841) (← links)
- Normal functors, power series and \(\lambda\)-calculus (Q1103618) (← links)
- Additives of linear logic and normalization. I: A (restricted) Church-Rosser property. (Q1398477) (← links)
- Phase semantics for light linear logic (Q1398478) (← links)
- Linear types and non-size-increasing polynomial time computation. (Q1401943) (← links)
- A proof-theoretic investigation of a logic of positions (Q1408856) (← links)
- Higher type recursion, ramification and polynomial time (Q1577477) (← links)
- Paths-based criteria and application to linear logic subsystems characterizing polynomial time (Q1640980) (← links)
- Characterizing polynomial and exponential complexity classes in elementary lambda-calculus (Q1640981) (← links)
- A type-based complexity analysis of object oriented programs (Q1640983) (← links)
- Stratified coherence spaces: A denotational semantics for light linear logic (Q1827389) (← links)
- Realizability models for BLL-like languages (Q1827395) (← links)
- Soft linear logic and polynomial time (Q1827397) (← links)
- On an interpretation of safe recursion in light affine logic (Q1827399) (← links)
- Focussing and proof construction (Q1840461) (← links)
- The additive multiboxes (Q1861326) (← links)
- (Optimal) duplication is not elementary recursive (Q1881231) (← links)
- Combining linear logic and size types for implicit complexity (Q1989323) (← links)
- Polynomial time in untyped elementary linear logic (Q1989326) (← links)
- Polynomial time over the reals with parsimony (Q2039933) (← links)
- Enhancing induction in a contraction free logic with unrestricted abstraction: from \(\mathbf{Z}\) to \(\mathbf{Z}_2\) (Q2085577) (← links)
- Soft subexponentials and multiplexing (Q2096472) (← links)
- Structural recursion as a query language on lists and ordered trees (Q2272218) (← links)
- On the expressivity of elementary linear logic: characterizing Ptime and an exponential time hierarchy (Q2343123) (← links)
- An abstract approach to stratification in linear logic (Q2343125) (← links)
- An arithmetic for polynomial-time computation (Q2500489) (← links)
- Infinitary action logic with multiplexing (Q2698280) (← links)
- On quasi-interpretations, blind abstractions and implicit complexity (Q2909730) (← links)
- Computational Complexity Via Finite Types (Q2946764) (← links)
- Light logics and higher-order processes (Q2971072) (← links)
- Build your own clarithmetic I: Setup and completeness (Q2974779) (← links)
