Results 11 to 20 of about 3,683 (247)

Sequential topologies and Dedekind finite sets [PDF]

Mathematical Logic Quarterly, 2022
AbstractIt is consistent with set theory that the Euclidean topology on is not sequential, yet every infinite set of reals contains a countably infinite subset. This answers a question of Gutierres.
openaire   +2 more sources

Inductive Definition and Domain Theoretic Properties of Fully Abstract [PDF]

, 2007
A construction of fully abstract typed models for PCF and PCF^+ (i.e., PCF + "parallel conditional function"), respectively, is presented. It is based on general notions of sequential computational strategies and wittingly consistent non-deterministic ...
Luke Ong, Vladimir Sazonov
core   +3 more sources

Sequentiality and Adaptivity Gains in Active Hypothesis Testing [PDF]

, 2012
Consider a decision maker who is responsible to collect observations so as to enhance his information in a speedy manner about an underlying phenomena of interest.
Javidi, Tara, Naghshvar, Mohammad
core   +1 more source

Dynamic Choreographies - Safe Runtime Updates of Distributed Applications [PDF]

, 2015
Programming distributed applications free from communication deadlocks and races is complex. Preserving these properties when applications are updated at runtime is even harder.
Gabbrielli, Maurizio, Giallorenzo, Saverio, Lanese, Ivan, Mauro, Jacopo, Preda, Mila Dalla   +4 more
core   +5 more sources

Separability in the Ambient Logic [PDF]

, 2008
The \it{Ambient Logic} (AL) has been proposed for expressing properties of process mobility in the calculus of Mobile Ambients (MA), and as a basis for query languages on semistructured data.
Andrew Gordon, Daniel Hirschkoff, Davide Sangiorgi, Etienne Lozes   +3 more
core   +7 more sources

Containment and equivalence of weighted automata: Probabilistic and max-plus cases [PDF]

, 2020
This paper surveys some results regarding decision problems for probabilistic and max-plus automata, such as containment and equivalence. Probabilistic and max-plus automata are part of the general family of weighted automata, whose semantics are maps ...
A Bertoni, A Paz, A Weber, AL Buchsbaum, D Krob, H Gimbert, H Seidl, I Klimann, I Simon, J Berstel, K Hashiguchi, K Hashiguchi, K Hashiguchi, K Hashiguchi, K Hashiguchi, KC Ii, L Daviaud, M Kwiatkowska, M Mohri, M Mohri, MO Rabin, MP Schützenberger, R Chadha, S Almagor, S Gaubert, T Colcombet, W Tzeng   +26 more
core   +2 more sources

Weak Sequential Convergence in Bounded Finitely Additive Measures [PDF]

Vietnam Journal of Mathematics, 2020
The second author is supported by Grant PGC2018-094431-B-I00 of the Ministry of Science, Innovation and Universities of Spain.
Salvador López-Alfonso, Manuel López-Pellicer   +1 more
openaire   +4 more sources

Dynamic Choreographies: Theory And Implementation [PDF]

, 2017
Programming distributed applications free from communication deadlocks and race conditions is complex. Preserving these properties when applications are updated at runtime is even harder.
Gabbrielli, Maurizio, Giallorenzo, Saverio, Lanese, Ivan, Mauro, Jacopo, Preda, Mila Dalla   +4 more
core   +4 more sources

Finite-sample complexity of sequential Monte Carlo estimators

The Annals of Statistics, 2023
Revisions to the proof.
Marion, Joe, Mathews, Joseph, Schmidler, Scott C.   +2 more
openaire   +3 more sources

On Berry's conjectures about the stable order in PCF [PDF]

, 2012
PCF is a sequential simply typed lambda calculus language. There is a unique order-extensional fully abstract cpo model of PCF, built up from equivalence classes of terms. In 1979, G\'erard Berry defined the stable order in this model and proved that the
Fritz Müller, Luke Ong
core   +1 more source