Zobrazeno 1 - 10
of 20
pro vyhledávání: '"Ross Tate"'
Publikováno v:
Logical Methods in Computer Science, Vol Volume 7, Issue 1 (2011)
Optimizations in a traditional compiler are applied sequentially, with each optimization destructively modifying the program to produce a transformed program that is then passed to the next optimization. We present a new approach for structuring the
Externí odkaz:
https://doaj.org/article/e225e6f7f8d744ae91336ae2478ea0f7
Publikováno v:
Proceedings of the ACM on Programming Languages. 5:1-26
As a scientific programming language, Julia strives for performance but also provides high-level productivity features. To avoid performance pathologies, Julia users are expected to adhere to a coding discipline that enables so-called type stability.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a8e056fcc546ccb28e768165adbe104a
https://doi.org/10.1145/3485527
https://doi.org/10.1145/3485527
Autor:
Fabian Muehlboeck, Ross Tate
Publikováno v:
Proceedings of the ACM on Programming Languages. 5:1-29
Gradual typing is a principled means for mixing typed and untyped code. But typed and untyped code often exhibit different programming patterns. There is already substantial research investigating gradually giving types to code exhibiting typical unt
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6070bc87724d5a52f29317021d3e2a39
https://doi.org/10.1145/3485504
https://doi.org/10.1145/3485504
Publikováno v:
Proceedings of the ACM on Programming Languages
Dynamic programming languages face semantic and performance challenges in the presence of features, such as eval, that can inject new code into a running program. The Julia programming language introduces the novel concept of world age to insulate op
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::08da3c20aafb8d2c96075d76caf9ce83
https://doi.org/10.1145/3428275
https://doi.org/10.1145/3428275
Publikováno v:
LICS
LICS 2021
LICS 2021, Jul 2021, Rome, Italy
LICS 2021
LICS 2021, Jul 2021, Rome, Italy
International audience; Constructive foundations have for decades been built upon realizability models for higher-order logic and type theory. However, traditional realizability models have a rather limited notion of computation, which only supports
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::72aef8d58c5fe040c3090123643bdf97
https://doi.org/10.1109/lics52264.2021.9470514
https://doi.org/10.1109/lics52264.2021.9470514
Publikováno v:
MFPS
It is commonly understood that Countable Choice holds constructively due to the underlying computational nature of constructivism. However, in this paper we demonstrate that invoking different notions of computation result in radically different beha
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2cdce469322f8676b5df020b118d6895
https://doi.org/10.1016/j.entcs.2019.09.006
https://doi.org/10.1016/j.entcs.2019.09.006
Publikováno v:
CSF
We present the Flow-Limited Authorization First-Order Logic (FLAFOL), a logic for reasoning about authorization decisions in the presence of information-flow policies. We formalize the FLAFOL proof system, characterize its proof-theoretic properties,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::238f54727b2708a1f1e1ec6fa7b0b180
http://arxiv.org/abs/2001.10630
http://arxiv.org/abs/2001.10630
Autor:
Ross Tate, Fabian Muehlboeck
Publikováno v:
Proceedings of the ACM on Programming Languages. 2:1-29
Union and intersection types are both simple and powerful but have seen limited adoption. The problem is that, so far, subtyping algorithms for type systems extended with union and intersections have typically been either unreliable or insufficiently
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::301dc56f16b3b86ea71966a57c5806d9
https://doi.org/10.1145/3276482
https://doi.org/10.1145/3276482
Autor:
Andrew K. Hirsch, Ross Tate
Publikováno v:
Proceedings of the ACM on Programming Languages. 2:1-30
Two particularly important classes of effects are those that can be given semantics using a monad and those that can be given semantics using a comonad. Currently, programs with both kinds of effects are usually given semantics using a technique that
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::64a2b33a049d39aeb10b9e0c3beb13e6
https://doi.org/10.1145/3236783
https://doi.org/10.1145/3236783
Autor:
Fabian Muehlboeck, Ross Tate
Publikováno v:
Proceedings of the ACM on Programming Languages. 1:1-30
Recent research has identified significant performance hurdles that sound gradual typing needs to overcome. These performance hurdles stem from the fact that the run-time checks gradual type systems insert into code can cause significant overhead. We
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2c657dcd2e9b4a8203b6a1523cfae4f8
https://doi.org/10.1145/3133880
https://doi.org/10.1145/3133880