Search results for "Computer Science::Programming Languages"
showing 10 items of 69 documents
Inductive types in homotopy type theory
2012
Homotopy type theory is an interpretation of Martin-L\"of's constructive type theory into abstract homotopy theory. There results a link between constructive mathematics and algebraic topology, providing topological semantics for intensional systems of type theory as well as a computational approach to algebraic topology via type theory-based proof assistants such as Coq. The present work investigates inductive types in this setting. Modified rules for inductive types, including types of well-founded trees, or W-types, are presented, and the basic homotopical semantics of such types are determined. Proofs of all results have been formally verified by the Coq proof assistant, and the proof s…
Quantum, stochastic, and pseudo stochastic languages with few states
2014
Stochastic languages are the languages recognized by probabilistic finite automata (PFAs) with cutpoint over the field of real numbers. More general computational models over the same field such as generalized finite automata (GFAs) and quantum finite automata (QFAs) define the same class. In 1963, Rabin proved the set of stochastic languages to be uncountable presenting a single 2-state PFA over the binary alphabet recognizing uncountably many languages depending on the cutpoint. In this paper, we show the same result for unary stochastic languages. Namely, we exhibit a 2-state unary GFA, a 2-state unary QFA, and a family of 3-state unary PFAs recognizing uncountably many languages; all th…
Span-program-based quantum algorithm for the rank problem
2011
Recently, span programs have been shown to be equivalent to quantum query algorithms. It is an open problem whether this equivalence can be utilized in order to come up with new quantum algorithms. We address this problem by providing span programs for some linear algebra problems. We develop a notion of a high level span program, that abstracts from loading input vectors into a span program. Then we give a high level span program for the rank problem. The last section of the paper deals with reducing a high level span program to an ordinary span program that can be solved using known quantum query algorithms.
Engineering Topological Nodal Line Semimetals in Rashba Spin-Orbit Coupled Atomic Chains
2019
We study an atomic chain in the presence of modulated charge potential and modulated Rashba spin-orbit coupling (RSOC) of equal period. We show that for commensurate periodicities $\lambda=4 n$ with integer $n$, the three-dimensional synthetic space obtained by sliding the two phases of the charge potential and RSOC features a topological nodal line semimetal protected by an antiunitary particle-hole symmetry. The location and shape of the nodal lines strongly depend on the relative amplitude between the charge potential and RSOC.
RECOGNIZABLE PICTURE LANGUAGES
1992
The purpose of this paper is to propose a new notion of recognizability for picture (two-dimensional) languages extending the characterization of one-dimensional recognizable languages in terms of local languages and alphabetic mappings. We first introduce the family of local picture languages (denoted by LOC) and, in particular, prove the undecidability of the emptiness problem. Then we define the new family of recognizable picture languages (denoted by REC). We study some combinatorial and language theoretic properties of REC such as ambiguity, closure properties or undecidability results. Finally we compare the family REC with the classical families of languages recognized by four-way a…
The Existence of Solutions for Local Dirichlet (r(u),s(u))-Problems
2022
In this paper, we consider local Dirichlet problems driven by the (r(u),s(u))-Laplacian operator in the principal part. We prove the existence of nontrivial weak solutions in the case where the variable exponents r,s are real continuous functions and we have dependence on the solution u. The main contributions of this article are obtained in respect of: (i) Carathéodory nonlinearity satisfying standard regularity and polynomial growth assumptions, where in this case, we use geometrical and compactness conditions to establish the existence of the solution to a regularized problem via variational methods and the critical point theory; and (ii) Sobolev nonlinearity, somehow related to the spac…
Graph-grammar semantics of a higher-order programming language for distributed systems
1994
We will consider a new tiny, yet powerful, programming language for distributed systems, called DHOP, which has its operational semantics given as algebraic graph rewrite rules in a certain category of labeled graphs. Our approach allows to separate actions which affect several processes from local changes such as variable bindings. We also sketch how to derive an implementation from this specification.
"Table 39" of "Tuning and test of fragmentation models based on identified particles and precision event shape data."
1996
Compilation of multiplicities of tensor mesons from current LEP I data.
"Table 37" of "Tuning and test of fragmentation models based on identified particles and precision event shape data."
1996
Compilation of multiplicities of scalar mesons from current LEP I data.
"Table 35" of "Tuning and test of fragmentation models based on identified particles and precision event shape data."
1996
Charged particle multiplicity compiled from current LEP I data.