Zobrazeno 1 - 10
of 247
pro vyhledávání: '"Igarashi, Atsushi"'
Fault-tolerant quantum computation using lattice surgery can be abstracted as operations on graphs, wherein each logical qubit corresponds to a vertex of the graph, and multi-qubit measurements are accomplished by connecting the vertices with paths b
Externí odkaz:
http://arxiv.org/abs/2409.00529
Many effect systems for algebraic effect handlers are designed to guarantee that all invoked effects are handled adequately. However, respective researchers have developed their own effect systems that differ in how to represent the collections of ef
Externí odkaz:
http://arxiv.org/abs/2404.16381
Publikováno v:
EPTCS 401, 2024, pp. 1-10
We explore the integration of metaprogramming in a call-by-value linear lambda-calculus and sketch its extension to a session type system. We build on a model of contextual modal type theory with multi-level contexts, where contextual values, closing
Externí odkaz:
http://arxiv.org/abs/2404.05475
Autor:
Wakizaka, Ryo, Igarashi, Atsushi
Qubit allocation is a process to assign physical qubits to logical qubits in a quantum program. Since some quantum computers have connectivity constraints on applications of two-qubit operations, it is mainly concerned with finding an assignment and
Externí odkaz:
http://arxiv.org/abs/2306.01856
Autor:
Nishida, Yuki, Saito, Hiromasa, Chen, Ran, Kawata, Akira, Furuse, Jun, Suenaga, Kohei, Igarashi, Atsushi
A smart contract is a program executed on a blockchain, based on which many cryptocurrencies are implemented, and is being used for automating transactions. Due to the large amount of money that smart contracts deal with, there is a surging demand fo
Externí odkaz:
http://arxiv.org/abs/2108.12971
A Merkle tree is a data structure for representing a key-value store as a tree. Each node of a Merkle tree is equipped with a hash value computed from those of their descendants. A Merkle tree is often used for representing a state of a blockchain sy
Externí odkaz:
http://arxiv.org/abs/2106.04826
Autor:
Nishida, Yuki, Igarashi, Atsushi
Recently, we have proposed coordinated choices, which are nondeterministic choices equipped with names. The main characteristic of coordinated choices is that they synchronize nondeterministic decision among choices of the same name. The motivation o
Externí odkaz:
http://arxiv.org/abs/2004.14084
Publikováno v:
J. Funct. Prog. 34 (2024) e7
The naive combination of polymorphic effects and polymorphic type assignment has been well known to break type safety. Existing approaches to this problem are classified into two groups: one for restricting how effects are triggered and the other for
Externí odkaz:
http://arxiv.org/abs/2003.08138
We present ConSORT, a type system for safety verification in the presence of mutability and aliasing. Mutability requires strong updates to model changing invariants during program execution, but aliasing between pointers makes it difficult to determ
Externí odkaz:
http://arxiv.org/abs/2002.07770