Abstract
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.
Cite
CITATION STYLE
Hasegawa, M. (1999). Logical predicates for intuitionistic linear type theories. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1581, pp. 198–213). Springer Verlag. https://doi.org/10.1007/3-540-48959-2_15
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
