Zobrazeno 1 - 10
of 15 022
pro vyhledávání: '"computer science - programming languages"'
Autor:
Dong, Yixin, Ruan, Charlie F., Cai, Yaxing, Lai, Ruihang, Xu, Ziyi, Zhao, Yilong, Chen, Tianqi
The applications of LLM Agents are becoming increasingly complex and diverse, leading to a high demand for structured outputs that can be parsed into code, structured function calls, and embodied agent commands. These developments bring significant d
Externí odkaz:
http://arxiv.org/abs/2411.15100
Autor:
Piñeiro, César, Pichel, Juan C.
Python demonstrates lower performance in comparison to traditional high performance computing (HPC) languages such as C, C++, and Fortran. This performance gap is largely due to Python's interpreted nature and the Global Interpreter Lock (GIL), which
Externí odkaz:
http://arxiv.org/abs/2411.14887
Autor:
Takyu, Kento, Ueda, Kazunori
Hierarchical graph rewriting is a highly expressive computational formalism that manipulates graphs enhanced with box structures for representing hierarchies. It has provided the foundations of various graph-based modeling tools, but the design of hi
Externí odkaz:
http://arxiv.org/abs/2411.14802
Relational object invariants (or representation invariants) are relational properties held by the fields of a (memory) object throughout its lifetime. For example, the length of a buffer never exceeds its capacity. Automatic inference of these invari
Externí odkaz:
http://arxiv.org/abs/2411.14735
Publikováno v:
EPTCS 412, 2024, pp. 19-34
We revisit the problem of synchronisability for communicating automata, i.e., whether the language of send messages for an asynchronous system is the same as the language of send messages with a synchronous communication. The un/decidability of the p
Externí odkaz:
http://arxiv.org/abs/2411.14580
Publikováno v:
EPTCS 412, 2024, pp. 2-18
We study the data-parallel language BUTF, inspired by the Futhark language for array programming. We give a translation of BUTF into a version of the pi-calculus with broadcasting and labeled names. The translation is both complete and sound. Moreove
Externí odkaz:
http://arxiv.org/abs/2411.14579
Autor:
Chait-Roth, Devora, Namjoshi, Kedar S.
Smart contracts form the core of Web3 applications. Contracts mediate the transfer of cryptocurrency, making them irresistible targets for hackers. We introduce ASP, a system aimed at easing the construction of provably secure contracts. The Asp syst
Externí odkaz:
http://arxiv.org/abs/2411.14563
Publikováno v:
EPTCS 411, 2024, pp. 20-37
The design and analysis of systems that combine computational behaviour with physical processes' continuous dynamics - such as movement, velocity, and voltage - is a famous, challenging task. Several theoretical results from programming theory emerge
Externí odkaz:
http://arxiv.org/abs/2411.14365
Autor:
Gilray, Thomas, Sahebolamri, Arash, Sun, Yihao, Kunapaneni, Sowmith, Kumar, Sidharth, Micinski, Kristopher
Datalog is a popular logic programming language for deductive reasoning tasks in a wide array of applications, including business analytics, program analysis, and ontological reasoning. However, Datalog's restriction to flat facts over atomic constan
Externí odkaz:
http://arxiv.org/abs/2411.14330
Autor:
Cate, Balder ten, Kappé, Tobias
Kleene Algebra with Tests (KAT) provides an elegant algebraic framework for describing non-deterministic finite-state computations. Using a small finite set of non-deterministic programming constructs (sequencing, non-deterministic choice, and iterat
Externí odkaz:
http://arxiv.org/abs/2411.14284