Non-Deterministic Abstract Machines

Autor: Biernacka, Małgorzata, Biernacki, Dariusz, Lenglet, Serguei, Schmitt, Alan

Publikováno v: [Research Report] RR-9475, Inria. 2022, pp.1-33
CONCUR 2022-33rd International Conference on Concurrency Theory
CONCUR 2022-33rd International Conference on Concurrency Theory, Sep 2022, Varsovie, Poland. pp.1-24, ⟨10.4230/LIPIcs.CONCUR.2022.7⟩

We present a generic design of abstract machines for nondeterministic programming languages, such as process calculi or concurrent lambda calculi, that provides a simple way to implement them. Such a machine traverses a term in the search for a redex

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7af8b5deecd8cde1d1dbe9279542cc40
https://inria.hal.science/hal-03545768v2/document

On the expressiveness of spatial constraint systems

Autor: Guzmán, Michell

Publikováno v: Logic in Computer Science [cs.LO]. Université Paris Saclay (COmUE), 2017. English. ⟨NNT : 2017SACLX064⟩

Epistemic, mobile and spatial behaviour are common place in today’s distributed systems. The intrinsic epistemic nature of these systems arises from the interactions of the elements taking part of them. Most people are familiar with digital systems

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=od_______212::dde4fc4bf2c77fa54c8c3fee03b71681
https://pastel.archives-ouvertes.fr/tel-01674956

Encodages complètement abstraits du λ en HOcore à l’aide de machines abstraites

Autor: Malgorzata Biernacka, Dariusz Biernacki, Serguei Lenglet, Piotr Polesiuk, Damien Pous, Alan Schmitt

Publikováno v: [Research Report] RR-9052, Inria. 2017
LICS 2017-32nd Annual ACM/IEEE Symposium on Logic in Computer Science
LICS 2017-32nd Annual ACM/IEEE Symposium on Logic in Computer Science, Jun 2017, Reykjavik, Iceland. ⟨10.1109/LICS.2017.8005118⟩
2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)

We present fully abstract encodings of the call-by-name lambda-calculus into HOcore, a minimal higher-order process calculus with no name restriction. We consider several equivalences on the lambda-calculus side---normal-form bisimilarity, applicativ

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3bf9f86f2ad607d8c849f1ab7f445cb9
https://inria.hal.science/hal-01507625/file/RR-9052.pdf

Méthode de Howe pour la sémantique contextuelle

Autor: Lenglet, Serguei, Schmitt, Alan

Publikováno v: CONCUR 2015 26th International Conference on Concurrency Theory
CONCUR 2015 26th International Conference on Concurrency Theory, Sep 2015, Madrid, Spain. ⟨10.4230/LIPIcs.CONCUR.2015.212⟩
[Research Report] RR-8750, Inria. 2015, pp.31

We show how to use Howe’s method to prove that context bisimilarity is a congruence for process calculi equipped with their usual semantics. We apply the method to two extensions of HOπ, with passivation and with join patterns, illustrating differ

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0f5e8ad19220ca6b6eeec9f342856960
https://hal.inria.fr/hal-01192699/document

Higher-order languages : dualities and bisimulation enhancements

Autor: Madiot, Jean-Marie

Les comportements des processus concurrents peuvent être exprimés en utilisant des calculs de processus, des langages formels simples qui permettent de démontrer des résultats mathématiques précis sur les interactions entre processus. Un exempl

Externí odkaz: http://www.theses.fr/2015ENSL0988/document