Answer-Type Modification without Tears: Prompt-Passing Style Translation for Typed Delimited-Control Operators

The salient feature of delimited-control operators is their ability to modify answer types during computation. The feature, answer-type modification (ATM for short), allows one to express various interesting programs such as typed printf compactly and nicely, while it makes it difficult to embed these operators in standard functional languages. In this paper, we present a typed translation of delimited-control operators shift and reset with ATM into a familiar language with multi-prompt shift and reset without ATM, which lets us use ATM in standard languages without modifying the type system. Our translation generalizes Kiselyov's direct-style implementation of typed printf, which uses two prompts to emulate the modification of answer types, and passes them during computation. We prove that our translation preserves typing. As the naive prompt-passing style translation generates and passes many prompts even for pure terms, we show an optimized translation that generate prompts only when needed, which is also type-preserving. Finally, we give an implementation in the tagless-final style which respects typing by construction.Comment: In Proceedings WoC 2015, arXiv:1606.0583

Derived PD-Hirsch extensions of filtered crystalline complexes and filtered crysalline dga's

We construct a theory of the derived PD-Hirsch extension of the log crystalline complex of a log smooth scheme and we construct a fundamental filtered dga $(H_{{\rm zar},{\rm TW}},P)$ and a fundamental filtered complex $(H_{\rm zar},P)$ for a simple normal crossing log scheme $X$ over a family of log points by using the log crystalline method in order to overcome obstacles arising from the incompatibility of the p-adic Steenbrink complexes in [M] and [Nak4] with the cup product of the log crystalline complex of $X$. When the base log scheme is the log point of a perfect field of characteristic $p>0$, we prove that $(H_{{\rm zar},{\rm TW}},P)$ and $(H_{\rm zar},P)$ is canonically isomorphic to Kim and Hain's filtered dga and their filtered complex in [KH], respectively.Comment: 156 pages. arXiv admin note: text overlap with arXiv:1902.0018

The History of Licorice Applications in Maruzen Pharmaceuticals Co., Ltd.

Licorice is the root and stolon of the genus Glycyrrhiza plants. Licorice has a long and storied history of use in both Eastern and Western cultures for over 4000 years. Licorice extracts and its principal component, glycyrrhizin, have been used extensively in foods, tobacco, and cosmetics and in both traditional and herbal medicines. Since its start-up in 1938, our company has been working on extracting and purifying the flavoring, sweetening, cosmetic, and medicinal constituents from licorice. At first, we were manufacturing licorice extracts for soy sauce. Recently, our company has developed new licorice products, such as antioxidative and antimicrobial products for foods from hydrophobic licorice extracts; whitening, antioxidative, and antityrosinase products for cosmetics from hydrophobic licorice extracts; antiaging products for cosmetics from licorice leaves; and some disease-suppression products for agriculture and fishery by water-soluble licorice flavonoids. This chapter presents the history of several kinds of food and cosmetic applications from many extracts and purified constituents from licorice plants in our company

Quantum Search Algorithm for Binary Constant Weight Codes

A binary constant weight code is a type of error-correcting code with a wide range of applications. The problem of finding a binary constant weight code has long been studied as a combinatorial optimization problem in coding theory. In this paper, we propose a quantum search algorithm for binary constant weight codes. Specifically, the search problem is newly formulated as a quadratic unconstrained binary optimization (QUBO) and Grover adaptive search (GAS) is used for providing the quadratic speedup. Focusing on the inherent structure of the problem, we derive an upper bound on the minimum of the objective function value and a lower bound on the exact number of solutions. In our algebraic analysis, it was found that this proposed algorithm is capable of reducing the number of required qubits, thus enhancing the feasibility. Additionally, our simulations demonstrated that it reduces the query complexities by 63% in the classical domain and 31% in the quantum domain. The proposed approach may be useful for other quantum search algorithms and optimization problems.Comment: 11 pages, 4 figure