Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Parallelism in Soft Linear Logic

Autor: Jacobé De Naurois, Paulin

Publikováno v: 5th International Workshop on Trends in Linear Logic and Applications (TLLA 2021)
5th International Workshop on Trends in Linear Logic and Applications (TLLA 2021), Jun 2021, Rome (virtual), Italy
Computer Science Logic
Computer Science Logic, Feb 2022, Göttingen, Germany. ⟨10.4230/LIPIcs..10⟩

We extend the Soft Linear Logic of Lafont with a new kind of modality, called parallel. Contractions on parallel modalities are only allowed in the cut and the left ��� rules, in a controlled, uniformly distributive way. We show that SLL, exten

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1a2fb2bec7e018e44e84d69a5f674737
https://hal-lirmm.ccsd.cnrs.fr/lirmm-03271468

Non-uniform complexity via non-wellfounded proofs

Autor: Curzi, Gianluca, Das, Anupam

Cyclic and non-wellfounded proofs are now increasingly employed to establish metalogical results in a variety of settings, in particular for type systems with forms of (co)induction. Under the Curry-Howard correspondence, a cyclic proof can be seen a

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c6ab27501433ecc49ceeac0d87775d14

The expressive power of one variable used once:The chomsky hierarchy and first-order monadic constructor rewriting

Autor: Simonsen, Jakob Grue

Publikováno v: Simonsen, J G 2021, The expressive power of one variable used once : The chomsky hierarchy and first-order monadic constructor rewriting . in N Kobayashi (ed.), 6th International Conference on Formal Structures for Computation and Deduction, FSCD 2021 ., 5, Schloss Dagstuhl-Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Leibniz International Proceedings in Informatics, LIPIcs, vol. 195, 6th International Conference on Formal Structures for Computation and Deduction, FSCD 2021, Virtual, Buenos Aires, Argentina, 17/07/2021 . https://doi.org/10.4230/LIPIcs.FSCD.2021.5

We study the implicit computational complexity of constructor term rewriting systems where every function and constructor symbol is unary or nullary. Surprisingly, adding simple and natural constraints to rule formation yields classes of systems that

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::41ee07b7b93b2448cca146b65d5855d0
https://curis.ku.dk/ws/files/281991643/The_Expressive_Power_of_One_Variable_Used_Once.pdf

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.