Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Sylvain Lebresne"'
Autor:
Sylvain Lebresne
Publikováno v:
Logical Methods in Computer Science, Vol Volume 5, Issue 4 (2009)
We present an extension of System F with call-by-name exceptions. The type system is enriched with two syntactic constructs: a union type for programs whose execution may raise an exception at top level, and a corruption type for programs that may ra
Externí odkaz:
https://doaj.org/article/c7e526300aa64b02a4c92590423b5f54
Publikováno v:
POPL
Many large software systems originate from untyped scripting language code. While good for initial development, the lack of static type annotations can impact code-quality and performance in the long run. We present an approach for integrating untype
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8cda3bf9ccc7240d4d83f60ceeb42c5c
https://doi.org/10.1145/1707801.1706343
https://doi.org/10.1145/1707801.1706343
Publikováno v:
PLDI
The JavaScript programming language is widely used for web programming and, increasingly, for general purpose computing. As such, improving the correctness, security and performance of JavaScript applications has been the driving force for research i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7c729eee4d6123f84b5ee528c908e563
https://doi.org/10.1145/1806596.1806598
https://doi.org/10.1145/1806596.1806598
Publikováno v:
Proceedings for the 1st workshop on Script to Program Evolution.
We report on preliminary results on understanding the nature of JavaScript programs. Our investigation is motivated by the goal of developing a type system for JavaScript programs. As a prelude, we decide to gain a better understanding of the dynamic
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::97587b50a098e3bc2fad23c8dccf2ac2
https://doi.org/10.1145/1570506.1570510
https://doi.org/10.1145/1570506.1570510
Autor:
Sylvain Lebresne
Publikováno v:
Automata, Languages and Programming ISBN: 9783540705826
ICALP (2)
ICALP (2)
We present an extension of System F with call-by-name exceptions. The type system is enriched with two syntactic constructs: a union type $A {\rlap{{*}}\cup} \{\varepsilon\}$ for programs of type Awhose execution may raise the exception i¾?at top le
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ceb4c9fff8e408f963ee57b3205e08b6
https://doi.org/10.1007/978-3-540-70583-3_27
https://doi.org/10.1007/978-3-540-70583-3_27
Publikováno v:
Graph-Theoretic Concepts in Computer Science
WG 2005
WG 2005, Dec 2006, Metz, France. pp.362-373
Graph-Theoretic Concepts in Computer Science ISBN: 9783540310006
WG
WG 2005
WG 2005, Dec 2006, Metz, France. pp.362-373
Graph-Theoretic Concepts in Computer Science ISBN: 9783540310006
WG
International audience; In this paper, we present a new algorithm for computing the chromatic polynomial of a general graph G. Our method is based on the addition of edges and contraction of non-edges of G, the base case of the recursion being chorda
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f313e2d597bc0d050cde807f55a8cd51
https://hal.archives-ouvertes.fr/hal-00150806
https://hal.archives-ouvertes.fr/hal-00150806