Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Narasimhamurthy, Monal"'
Autor:
Hammer, Matthew A., Dunfield, Jana, Headley, Kyle, Narasimhamurthy, Monal, Economou, Dimitrios J.
Incremental computations attempt to exploit input similarities over time, reusing work that is unaffected by input changes. To maximize this reuse in a general-purpose programming setting, programmers need a mechanism to identify dynamic allocations
Externí odkaz:
http://arxiv.org/abs/1808.07826
Autor:
Martínez, Guido, Ahman, Danel, Dumitrescu, Victor, Giannarakis, Nick, Hawblitzel, Chris, Hritcu, Catalin, Narasimhamurthy, Monal, Paraskevopoulou, Zoe, Pit-Claudel, Clément, Protzenko, Jonathan, Ramananandro, Tahina, Rastogi, Aseem, Swamy, Nikhil
We introduce Meta-F*, a tactics and metaprogramming framework for the F* program verifier. The main novelty of Meta-F* is allowing the use of tactics and metaprogramming to discharge assertions not solvable by SMT, or to just simplify them into well-
Externí odkaz:
http://arxiv.org/abs/1803.06547
Many programming language techniques for incremental computation employ programmer-specified names for cached information. At runtime, each name identifies a "cache location" for a dynamic data value or a sub-computation; in sum, these cache location
Externí odkaz:
http://arxiv.org/abs/1610.00097