Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Goldstein, Harrison"'
Suppose we are given two OCaml modules implementing the same signature. How do we check that they are observationally equivalent -- that is, that they behave the same on all inputs? One established technique is to use a property-based testing (PBT) t
Externí odkaz:
http://arxiv.org/abs/2408.14561
Autor:
Cutler, Joseph W., Watson, Christopher, Nkurumeh, Emeka, Hilliard, Phillip, Goldstein, Harrison, Stanford, Caleb, Pierce, Benjamin C.
We propose a rich foundational theory of typed data streams and stream transformers, motivated by two high-level goals: (1) The type of a stream should be able to express complex sequential patterns of events over time. And (2) it should describe the
Externí odkaz:
http://arxiv.org/abs/2307.09553
"A generator is a parser of randomness." This perspective on generators for random data structures is well established as folklore in the programming languages community, but it has apparently never been formalized, nor have its consequences been dee
Externí odkaz:
http://arxiv.org/abs/2203.00652
Novel user interfaces based on artificial intelligence, such as natural-language agents, present new categories of engineering challenges. These systems need to cope with uncertainty and ambiguity, interface with machine learning algorithms, and comp
Externí odkaz:
http://arxiv.org/abs/1709.04991
Publikováno v:
Programming Languages and Systems
Property-based testing uses randomly generated inputs to validate high-level program specifications. It can be shockingly effective at finding bugs, but it often requires generating a very large number of inputs to do so. In this paper, we apply idea