Zobrazeno 1 - 10
of 137
pro vyhledávání: '"I.1.3"'
We present a tool and theory RE# for regular expression matching that is built on symbolic derivatives, does not use backtracking, and, in addition to the classical operators, also supports complement, intersection and lookarounds. We develop the the
Externí odkaz:
http://arxiv.org/abs/2407.20479
Autor:
Norman, Arthur C., Watt, Stephen M.
Symbolic mathematical computing systems have served as a canary in the coal mine of software systems for more than sixty years. They have introduced or have been early adopters of programming language ideas such ideas as dynamic memory management, ar
Externí odkaz:
http://arxiv.org/abs/2406.09085
Autor:
Cheli, Alessandro, Heim, Niklas
We introduce the third major version of Metatheory.jl, a Julia library for general-purpose metaprogramming and symbolic computation. Metatheory.jl provides a flexible and performant implementation of e-graphs and Equality Saturation (EqSat) that addr
Externí odkaz:
http://arxiv.org/abs/2404.08751
Autor:
Pratten, David Robert, Mathieson, Luke
Separate programming models for data transformation (declarative) and computation (procedural) impact programmer ergonomics, code reusability and database efficiency. To eliminate the necessity for two models or paradigms, we propose a small but high
Externí odkaz:
http://arxiv.org/abs/2309.11178
Autor:
Caldarelli, Giulio
Before the advent of alternative blockchains such as Ethereum, the future of decentralization was all in the hands of Bitcoin. Together with Nakamoto itself, early developers were trying to leverage Bitcoin potential to decentralize traditionally cen
Externí odkaz:
http://arxiv.org/abs/2302.07911
Autor:
Gajda, Michał J.
Publikováno v:
Analytics in Finance and Risk Management 2024
Can we infer sources of errors from outputs of the complex data analytics software? Bidirectional programming promises that we can reverse flow of software, and translate corrections of output into corrections of either input or data analysis. This a
Externí odkaz:
http://arxiv.org/abs/2301.12583
Publikováno v:
EPTCS 359, 2022, pp. 61-75
VWSIM is a circuit simulator for rapid, single-flux, quantum (RSFQ) circuits. The simulator is designed to model and simulate primitive-circuit devices such as capacitors, inductors, Josephson Junctions, and can be extended to simulate other circuit
Externí odkaz:
http://arxiv.org/abs/2205.11698
We consider the problem of learning the semantics of composite algebraic expressions from examples. The outcome is a versatile framework for studying learning tasks that can be put into the following abstract form: The input is a partial algebra $\al
Externí odkaz:
http://arxiv.org/abs/2204.02813
Autor:
Minato, Shin-ichi, Banbara, Mutsunori, Horiyama, Takashi, Kawahara, Jun, Takigawa, Ichigaku, Yamaguchi, Yutaro
In this paper, we propose a fast method for exactly enumerating a very large number of all lower cost solutions for various combinatorial problems. Our method is based on backtracking for a given decision diagram which represents all the feasible sol
Externí odkaz:
http://arxiv.org/abs/2201.08118
Autor:
Cheli, Alessandro
This thesis proposes an advanced, generic and high-level code rewriting and analysis system in the Julia programming language, providing applied equality saturation in the presence of multiple dispatch and metaprogramming. We show how our system can
Externí odkaz:
http://arxiv.org/abs/2112.14714