We present a new technique for optimizing programs, based on data-ow analysis. The initial goal was to provide a simple way to improve on Leroy and Peyton-Jones' techniques for optimizing boxings (allocations) and unboxings ((eld selection) away in strongly-typed functional programs. Our techniques achieve this goal, while not needing types any more (so it applies to Lisp as well as to ML), and...

Multilinear interpolation is a powerful tool used in obtaining strong type boundedness for a variety of operators assuming only a finite set of restricted weak-type estimates. A typical situation occurs when one knows that a multilinear operator satisfies a weak L estimate for a single index q (which may be less than one) and that all the adjoints of the multilinear operator are of similar natu...

With the increasing use of general robotic platforms in different application scenarios, modularity and reusability have become key issues in effective robotics programming. In this paper, we present a minimalist approach for designing robot software, in which very simple modules, with well designed interfaces and very little redundancy can be connected through a strongly typed framework to spe...

Modelica is a modern, strongly typed, declarative, equation-based, and object-oriented language for modeling and simulation of complex systems. Major features are: ease of use, visual design of models with combination of lego-like predefined model building blocks, ability to define model libraries with reusable components, support for modeling and simulation of complex applications involving pa...

We analyse the philosopher Davidson’s semantics of actions, using a strongly typed logic with contexts given by sets of partial equations between the outcomes of actions. This provides a perspicuous and elegant treatment of reasoning about action, analogous to Reiter’s work on artificial intelligence. We define a sequent calculus for this logic, prove cut elimination, and give a semantics based...

Abstract: We present theoretical properties of the log-concave maximum likelihood estimator of a density based on an independent and identically distributed sample in R. Our study covers both the case where the true underlying density is log-concave, and where this model is misspecified. We begin by showing that for a sequence of log-concave densities, convergence in distribution implies much s...

Let L = −∆+ V be a Schrödinger operator on R, d ≥ 3, where V is a nonnegative function, V 6= 0, and belongs to the reverse Hölder class RHd/2. The purpose of this paper is three-fold. First, we prove a version of the classical theorem of Jones and Journé on weak∗-convergence in H L(R ). Secondly, we give a bilinear decomposition for the product space H L(R )×BMOL(R). Finally, we study the commu...

An implementation of a component-free symbolic vector algebra in Aldor is presented. This package provides two powerful functions: simplification of vector expressions and the proof of vector identities. The implementation benefits greatly from Aldor’s strong typing, which allows several simplification problems that have defeated previous implementations to be solved.

Object-oriented data models are receiving wide attention since they provide expressive abstraction mechanisms to model naturally and directly both structural and behavioral aspects of complex databases applications. In an objectoriented data model, a database is modeled in terms of objects grouped in classes, organized into subclasses hierarchies. Moreover, associations between entities are mod...

The goal of the Mathemagix project is to develop a new and free software for computer algebra and computer analysis, based on a strongly typed and compiled language. In this paper, we focus on the underlying type system of this language, which allows for heavy overloading, including parameterized overloading with parameters in so called “categories”. The exposition is informal and aims at givin...