Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Mehdi Dogguy"'
Publikováno v:
International Conference on Software Engineering
International Conference on Software Engineering, May 2014, Hyderabad, India. pp.756-766, ⟨10.1145/2568225.2568262⟩
ICSE
International Conference on Software Engineering, May 2014, Hyderabad, India. pp.756-766, ⟨10.1145/2568225.2568262⟩
ICSE
International audience; Modern software systems are built by composing components drawn from large repositories, whose size and complexity increase at a fast pace. Maintaining and evolving these software collections is a complex task, and a strict qu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d6814a8751f22be9b3bbd55a90b6e665
https://hal.archives-ouvertes.fr/hal-01134312
https://hal.archives-ouvertes.fr/hal-01134312
Autor:
Mehdi Dogguy, Roberto Amadio
Publikováno v:
Programming Languages and Systems ISBN: 9783540893295
APLAS
APLAS
We describe a type system for a synchronous *** -calculus formalising the notion of affine usage in signal-based communication. In particular, we identify a limited number of usages that preserve affinity and that can be composed. As a main applicati
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::aa346701ea84311d613d867b1668d89b
https://doi.org/10.1007/978-3-540-89330-1_16
https://doi.org/10.1007/978-3-540-89330-1_16
Publikováno v:
HAL
Studia Informatica Universalis
Studia Informatica Universalis, Hermann, 2011, 9 (1), pp.129-157
Proceedings of the 21st Journée Francophones des Langages Applicatifs (JFLA 2010)
21st Journée Francophones des Langages Applicatifs (JFLA 2010)
21st Journée Francophones des Langages Applicatifs (JFLA 2010), Jan 2010, La Ciotat, France. pp.29-54
Studia Informatica Universalis
Studia Informatica Universalis, Hermann, 2011, 9 (1), pp.129-157
Proceedings of the 21st Journée Francophones des Langages Applicatifs (JFLA 2010)
21st Journée Francophones des Langages Applicatifs (JFLA 2010)
21st Journée Francophones des Langages Applicatifs (JFLA 2010), Jan 2010, La Ciotat, France. pp.29-54
International audience; Strongly-typed languages rely on link-time checks to ensure that type safety is not violated at the borders of compilation units. Such checks entail very fine-grained dependencies among compilation units, which are at odds wit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::6870b59f5b4a22fa5da3d7e4a13b354d
https://hal.archives-ouvertes.fr/hal-00687004
https://hal.archives-ouvertes.fr/hal-00687004