Related papers: Towards Refinable Choreographies
We present a new type system combining occurrence typing, previously used to type check programs in dynamically-typed languages such as Racket, JavaScript, and Ruby, with dependent refinement types. We demonstrate that the addition of…
Any procedure applied to data, and any quantity derived from data, is required to respect the nature and symmetries of the data. This axiom applies to refinement procedures and multiresolution transforms as well as to more basic operations…
In the past years, deep learning models have been successfully applied in several cognitive tasks. Originally inspired by neuroscience, these models are specific examples of differentiable programs. In this paper we define and motivate…
A relational structure R is ultrahomogeneous if every isomorphism of finite induced substructures of R extends to an automorphism of R. We classify the ultrahomogeneous finite binary relational structures with one asymmetric binary relation…
Concurrent programming often entails meticulous pairing of sends and receives between participants to avoid deadlock. Choreographic programming alleviates this burden by specifying the system as a single program. However, there are more…
Graph colorings are becoming an increasingly useful family of mathematical models for a broad range of applications, such as time tabling and scheduling, frequency assignment, register allocation, computer security and so on. Graph proper…
We develop a general framework for the discussion of detailed balance and analyse its microscopic background. We find that there should be two additions to the well-known $T$- or $PT$-invariance of the microscopic laws of motion: 1.…
We demonstrate that individual behaviors directed at the attainment of distinctiveness can in fact produce complete social conformity. We thus offer an unexpected generative mechanism for this central social phenomenon. Specifically, we…
We introduce the notion of filtration between topologies and study its stabilization properties. Descriptive set theoretic complexity plays a role in this study. Filtrations lead to natural transfinite sequences approximating a given…
In recent work we have shown how an accurate reduced model can be utilized to perform mesh refinement in random space. That work relied on the explicit knowledge of an accurate reduced model which is used to monitor the transfer of activity…
We think about what the subscheme of the formal scheme is. Differently form the ordinary scheme, the formal scheme has different notions of ``subscheme''. We lay a foundation for these notions and compare them. We also relate them to…
We investigate the value of extending the completeness of a decision model along different dimensions of refinement. Specifically, we analyze the expected value of quantitative, conceptual, and structural refinement of decision models. We…
We develop a general obstruction theory to the formality of algebraic structures over any commutative ground ring. It relies on the construction of Kaledin obstruction classes that faithfully detect the formality of differential graded…
We study seminormalization of affine complex varieties. We show that polynomials on the seminormalization correspond to the rational functions which are continuous for the Euclidean topology. We further study this type of functions which…
This is a companion piece to my paper on "Example-Based Procedural Modeling Using Graph Grammars." This paper examines some of the theoretical issues in more detail. This paper discusses some more complex parts of the implementation, why…
This thesis embarks on a comprehensive exploration of formal computational models that underlie typed programming languages. We focus on programming calculi, both functional (sequential) and concurrent, as they provide a compelling rigorous…
In this work we provide a computationally tractable procedure for designing affine control policies, applied to constrained, discrete-time, partially observable, linear systems subject to set bounded disturbances, stochastic noise and…
Growing graphs describe a multitude of developing processes from maturing brains to expanding vocabularies to burgeoning public transit systems. Each of these growing processes likely adheres to proliferation rules that establish an…
Necessary and sufficient conditions for a finite connected graph with a strict partial order on vertices to be a combinatorial invariant of pseudoharmonic function are obtained.
Ordinary differential equation models are nowadays widely used for the mechanistic description of biological processes and their temporal evolution. These models typically have many unknown and non-measurable parameters, which have to be…