288 research outputs found
Dependent Types for Pragmatics
This paper proposes the use of dependent types for pragmatic phenomena such
as pronoun binding and presupposition resolution as a type-theoretic
alternative to formalisms such as Discourse Representation Theory and Dynamic
Semantics.Comment: This version updates the paper for publication in LEU
Two kinds of procedural semantics for privative modification
In this paper we present two kinds of procedural semantics for privative modification. We do this for three reasons. The first reason is to launch a tough test case to gauge the degree of substantial agreement between a constructivist and a realist interpretation of procedural semantics; the second is to extend Martin-L Ìfâs Constructive Type Theory to privative modification, which is characteristic of natural language; the third reason is to sketch a positive characterization of privation
Amplification by stochastic interference
A new method is introduced to obtain a strong signal by the interference of
weak signals in noisy channels. The method is based on the interference of 1/f
noise from parallel channels. One realization of stochastic interference is the
auditory nervous system. Stochastic interference may have broad potential
applications in the information transmission by parallel noisy channels
Impredicative Encodings of (Higher) Inductive Types
Postulating an impredicative universe in dependent type theory allows System
F style encodings of finitary inductive types, but these fail to satisfy the
relevant {\eta}-equalities and consequently do not admit dependent eliminators.
To recover {\eta} and dependent elimination, we present a method to construct
refinements of these impredicative encodings, using ideas from homotopy type
theory. We then extend our method to construct impredicative encodings of some
higher inductive types, such as 1-truncation and the unit circle S1
An Editor for Helping Novices to Learn Standard ML
This paper describes a novel editor intended as an aid in the learning of the functional programming language Standard ML. A common technique used by novices is programming by analogy whereby students refer to similar programs that they have written before or have seen in the course literature and use these programs as a basis to write a new program. We present a novel editor for ML which supports programming by analogy by providing a collection of editing commands that transform old programs into new ones. Each command makes changes to an isolated part of the program. These changes are propagated to the rest of the program using analogical techniques. We observed a group of novice ML students to determine the most common programming errors in learning ML and restrict our editor such that it is impossible to commit these errors. In this way, students encounter fewer bugs and so their rate of learning increases. Our editor, C Y NTHIA, has been implemented and is due to be tested on st..
Ω-Arithmetization of Ellipses
International audienceMulti-resolution analysis and numerical precision problems are very important subjects in fields like image analysis or geometrical modeling. In the continuation of our previous works, we propose to apply the method of Ω-arithmetization to ellipses. We obtain a discrete multi-resolution representation of arcs of ellipses. The corresponding algorithms are completely constructive and thus, can be exactly translated into functional computer programs. Moreover, we give a global condition for the connectivity of the discrete curves generated by the method at every scale
On the Numerical Study of the Complexity and Fractal Dimension of CMB Anisotropies
We consider the problem of numerical computation of the Kolmogorov complexity
and the fractal dimension of the anisotropy spots of Cosmic Microwave
Background (CMB) radiation. Namely, we describe an algorithm of estimation of
the complexity of spots given by certain pixel configuration on a grid and
represent the results of computations for a series of structures of different
complexity. Thus, we demonstrate the calculability of such an abstract
descriptor as the Kolmogorov complexity for CMB digitized maps. The correlation
of complexity of the anisotropy spots with their fractal dimension is revealed
as well. This technique can be especially important while analyzing the data of
the forthcoming space experiments.Comment: LATEX, 3 figure
Higher Order Containers
Abstract. Containers are a semantic way to talk about strictly positive types. In previous work it was shown that containers are closed under various constructions including products, coproducts, initial algebras and terminal coalgebras. In the present paper we show that, surprisingly, the category of containers is cartesian closed, giving rise to a full cartesian closed subcategory of endofunctors. The result has interesting applications syntax. We also show that while the category of containers has finite limits, it is not locally cartesian closed.
Equilibration of isolated macroscopic quantum systems
We investigate the equilibration of an isolated macroscopic quantum system in
the sense that deviations from a steady state become unmeasurably small for the
overwhelming majority of times within any sufficiently large time interval. The
main requirements are that the initial state, possibly far from equilibrium,
exhibits a macroscopic population of at most one energy level and that
degeneracies of energy eigenvalues and of energy gaps (differences of energy
eigenvalues) are not of exceedingly large multiplicities. Our approach closely
follows and extends recent works by Short and Farrelly [2012 New J. Phys. 14
013063], in particular going beyond the realm of finite-dimensional systems and
large effective dimensions.Comment: 19 page
Algebraic totality, towards completeness
Finiteness spaces constitute a categorical model of Linear Logic (LL) whose
objects can be seen as linearly topologised spaces, (a class of topological
vector spaces introduced by Lefschetz in 1942) and morphisms as continuous
linear maps. First, we recall definitions of finiteness spaces and describe
their basic properties deduced from the general theory of linearly topologised
spaces. Then we give an interpretation of LL based on linear algebra. Second,
thanks to separation properties, we can introduce an algebraic notion of
totality candidate in the framework of linearly topologised spaces: a totality
candidate is a closed affine subspace which does not contain 0. We show that
finiteness spaces with totality candidates constitute a model of classical LL.
Finally, we give a barycentric simply typed lambda-calculus, with booleans
and a conditional operator, which can be interpreted in this
model. We prove completeness at type for
every n by an algebraic method
- âŠ