Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Paulus, Joseph W. N."'
We consider the problem of designing typed concurrent calculi with non-deterministic choice in which types leverage linearity for controlling resources, thereby ensuring strong correctness properties for processes. This problem is constrained by the
Externí odkaz:
http://arxiv.org/abs/2411.07714
Termination is a central property in sequential programming models: a term is terminating if all its reduction sequences are finite. Termination is also important in concurrency in general, and for message-passing programs in particular. A variety of
Externí odkaz:
http://arxiv.org/abs/2308.01165
We study functional and concurrent calculi with non-determinism, along with type systems to control resources based on linearity. The interplay between non-determinism and linearity is delicate: careless handling of branches can discard resources mea
Externí odkaz:
http://arxiv.org/abs/2205.00680
Type-preserving translations are effective rigorous tools in the study of core programming calculi. In this paper, we develop a new typed translation that connects sequential and concurrent calculi; it is governed by type systems that control resourc
Externí odkaz:
http://arxiv.org/abs/2112.01593
Publikováno v:
Logical Methods in Computer Science, Volume 19, Issue 4 (October 10, 2023) lmcs:8812
We study encodings of the lambda-calculus into the pi-calculus in the unexplored case of calculi with non-determinism and failures. On the sequential side, we consider lambdafail, a new non-deterministic calculus in which intersection types control r
Externí odkaz:
http://arxiv.org/abs/2104.14759
Publikováno v:
Logical Methods in Computer Science (LMCS); 2023, Vol. 19 Issue 4, p1-120, 120p
We study non-determinism in functional and concurrent calculi with type systems that control resources. We are motivated by the differences between so-called non-collapsing and collapsing non-deterministic choice. In non-collapsing non-determinism, a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9876aa71b34ff19376ab06dec3ea5da4
http://arxiv.org/abs/2205.00680
http://arxiv.org/abs/2205.00680
Autor:
Paulus, Joseph W. N., Nantes-Sobrinho, Daniele, Pérez, Jorge A., Basold, Henning, Cockx, Jesper, Ghilezan, Silvia
Publikováno v:
27th International Conference on Types for Proofs and Programs (TYPES 2021), 11.1-11.24
STARTPAGE=11.1;ENDPAGE=11.24;TITLE=27th International Conference on Types for Proofs and Programs (TYPES 2021)
STARTPAGE=11.1;ENDPAGE=11.24;TITLE=27th International Conference on Types for Proofs and Programs (TYPES 2021)
Type-preserving translations are effective rigorous tools in the study of core programming calculi. In this paper, we develop a new typed translation that connects sequential and concurrent calculi; it is governed by type systems that control resourc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::dbb82270391eb586616f9b61bca654a2
https://doi.org/10.4230/lipics.types.2021.11
https://doi.org/10.4230/lipics.types.2021.11
Autor:
Guerrieri, Giulio, Heijltjes, Willem B., Paulus, Joseph W. N., Baier, Christel, Goubault-Larrecq, Jean
Publikováno v:
Guerrieri, G, Heijltjes, W & Paulus, J 2021, A deep quantitative type system . in C Baier & J Goubault-Larrecq (eds), 29th EACSL Annual Conference on Computer Science Logic, CSL 2021 : CSL 2021 . 2021 edn, vol. 183, 24, Leibniz International Proceedings in Informatics, LIPIcs, vol. 183, Schloss Dagstuhl-Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Dagstuhl, Germany, pp. 24:1-24:24, 29th EACSL Annual Conference on Computer Science Logic (CSL 2021), Lubijana, Slovenia, 25/01/21 . https://doi.org/10.4230/LIPIcs.CSL.2021.24
29th EACSL Annual Conference on Computer Science Logic (CSL 2021), 24:1-24:24
STARTPAGE=24:1;ENDPAGE=24:24;TITLE=29th EACSL Annual Conference on Computer Science Logic (CSL 2021)
29th EACSL Annual Conference on Computer Science Logic (CSL 2021), 24:1-24:24
STARTPAGE=24:1;ENDPAGE=24:24;TITLE=29th EACSL Annual Conference on Computer Science Logic (CSL 2021)
We investigate intersection types and resource lambda-calculus in deep-inference proof theory. We give a unified type system that is parametric in various aspects: it encompasses resource calculi, intersection-typed lambda-calculus, and simply-typed
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fd66c817ee971ec5d3c66094f45a2541
https://doi.org/10.4230/LIPIcs.CSL.2021.24
https://doi.org/10.4230/LIPIcs.CSL.2021.24