Pre/post contracts for higher-order functions, as proposed by Findler and Felleisen and provided in Racket, allow run-time verification and blame assignment of higher-order functions. However these contracts treat contracted functions as black boxes, allowing verification of only input and output. It turns out that many interesting concerns about the behaviour of a function require going beyond...

It is the aim of this paper to advocate the use of functor categories as a semantic foundation of higher-order abstract syntax (HOAS). By way of example, we will show how functor categories can be used for at least the following applications: relating first-order and higher-order abstract syntax (proofs of adequacy) without using reduction rules, justifying induction principles and other axioms...

In this paper we maximize the utility of a structural model of the demand for multi-destination non-work travel using maximum entropy method introduced by Shanon. A utility value is assigned when only partial information is available about the decision maker’s preferences. The maximum entropy utility solution embeds a large family of utility functions that includes the most commonly used functi...

It is shown that in the estimation of an arbitrary signal corrupted by additive Gaussian noise, the optimum minimum-variance estimator is always a simple linear transformation of the logarithmic gradient of the average likelihood ratio which is obtained in the optimum detection of the same signal. Conversely, the average likelihood ratio can always be expressed in a simple functional form conta...

The language LRTp is a non-deterministic language for exact real number computation. It has been shown that all computable first order relations in the sense of Brattka are definable in the language. If we restrict the language to single-valued total relations (e.g. functions), all polynomials are definable in the language. In this paper we show that the non-deterministic version of the limit o...

The division problem consists of allocating an amount of a perfectly divisible good among a group of n agents with single-peaked preferences. A rule maps preference profiles into n shares of the amount to be allocated. A rule is bribe-proof if no group of agents can compensate another agent to misrepresent his preference and, after an appropriate redistribution of their shares, each obtain a st...

We describe a framework for the design of directional derivative kernels for two-dimensional discrete signals in which we optimize a measure of rotation-equivariance in the Fourier domain. The formulation is applicable to rst-order and higher-order derivatives. We design a set of compact, separable, linear-phase derivative kernels of di erent orders and demonstrate their accuracy.

Consider a sequence X = (Xn : n ≥ 1) of iid random variables (r.v.’s) and a geometrically distributed r.v. M with parameter p and independent of X. The r.v. SM = X1 + ... + XM is called a geometric sum. In this paper, we obtain asymptotic expansions for the distribution of SM as p& 0. If EX > 0 the asymptotic expansion is developed in powers of p and it provides higher order correction terms to...

We consider the problem of estimating the values of a function over n nodes of a d-dimensional grid graph (having equal side lengths n) from noisy observations. The function is assumed to be smooth, but is allowed to exhibit different amounts of smoothness at different regions in the grid. Such heterogeneity eludes classical measures of smoothness from nonparametric statistics, such as Holder s...

In this paper, we extend Simple Conceptual Graphs with Reiter’s default rules. The motivation for this extension came from the type of reasonings involved in an agronomy application, namely the simulation of food processing. Our contribution is many fold: first, the expressivity of this new language corresponds to our modeling purposes. Second, we provide an effective characterization of sound ...