Zobrazeno 1 - 10
of 35
pro vyhledávání: '"Tate, Ross"'
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:
http://arxiv.org/abs/2109.01950
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:
http://arxiv.org/abs/2010.07516
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:
http://arxiv.org/abs/2001.10630
Publikováno v:
Logical Methods in Computer Science, Volume 7, Issue 1 (March 28, 2011) lmcs:1016
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:
http://arxiv.org/abs/1012.1802
Autor:
Tate, Ross
Gradual typing is often motivated by efforts to add types to massive untyped code bases. A major challenge here is the fact that these code bases were not written with types in mind, yet the goal is to add types to them without requiring any signific
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e985a4e0cbad983c915f9023741815cc
Publikováno v:
ENTCS: Electronic Notes in Theoretical Computer Science; Nov2019, Vol. 347, p87-120, 34p
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Tate, Ross
Publikováno v:
Tate, Ross; & Tate, Ross. (2012). Equality saturation : using equational reasoning to optimize imperative functions. UC San Diego: Retrieved from: http://www.escholarship.org/uc/item/3gk5h8jp
Traditional optimizers have viewed imperative functions as a sequence or graph of commands. Some of these commands interact with the heap, throw exceptions, or interact with the outside world. Other commands simply read and modify local variables. In
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______325::555f364d51741930f19b8398c54c6572
http://n2t.net/ark:/20775/bb5769262k
http://n2t.net/ark:/20775/bb5769262k
In recent research, we have developed a new approach to structuring optimizers, and to make this approach effective, we have designed a new IR called Program Expression Graphs (PEG). The details of the PEG representation can be found elsewhere. In th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______325::7da5d637b29aab285a72f55ea34a9e28
https://escholarship.org/uc/item/1pw0d38g
https://escholarship.org/uc/item/1pw0d38g
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.