Theoretical Computer Science
Bilinear logic in algebra and linguistics
Proceedings of the workshop on Advances in linear logic
A characterization of lambda definability in categorical models of implicit polymorphism
Theoretical Computer Science
Specification structures and propositions-as-types for concurrency
Proceedings of the VIII Banff Higher order workshop conference on Logics for concurrency : structure versus automata: structure versus automata
On the runtime complexity of type-directed unboxing
ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming
What is a Categorical Model of Intuitionistic Linear Logic?
TLCA '95 Proceedings of the Second International Conference on Typed Lambda Calculi and Applications
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Linear Lambda-Calculus and Categorial Models Revisited
CSL '92 Selected Papers from the Workshop on Computer Science Logic
CSL '92 Selected Papers from the Workshop on Computer Science Logic
A Mixed Linear and Non-Linear Logic: Proofs, Terms and Models (Extended Abstract)
CSL '94 Selected Papers from the 8th International Workshop on Computer Science Logic
From Action Calculi to Linear Logic
CSL '97 Selected Papers from the11th International Workshop on Computer Science Logic
Finite Models and Full Completeness
Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
Classical Linear Logic of Implications
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
Relational parametricity for a polymorphic linear lambda calculus
APLAS'10 Proceedings of the 8th Asian conference on Programming languages and systems
| Hi-index | 0.00 |
We develop a notion of Kripke-like parameterized logical predicates for two fragments of intuitionistic linear logic (MILL and DILL) in terms of their category-theoretic models. Such logical predicates are derived from the categorical glueing construction combined with the free symmetric monoidal cocompletion. As applications, we obtain full completeness results of translations between linear type theories.