Related papers: Functional interpretation and inductive definition…

The Fourier transform is naturally defined for integrable functrions. Otherwise, it should be stipulated in which sense the Fourier transform is understood. We consider some class of radial and, generally saying, nonintegrable functions.…

We present a refinement of the Calculus of Inductive Constructions in which one can easily define a notion of relational parametricity. It provides a new way to automate proofs in an interactive theorem prover like Coq.

This is the English translation of my old paper 'Definici\'on y estudio de una funci\'on indefinidamente diferenciable de soporte compacto', Rev. Real Acad. Ciencias 76 (1982) 21-38. In it a function (essentially Fabius function) is defined…

In this paper we define a family of continuous functions of an arbitrary number of variables, and prove that they all satisfy a generalization of one of the classical functional equations of the inverse tangent function.

We introduce spaces of exponential constructible functions in the motivic setting for which we construct direct image functors in the absolute and relative cases. This allows us to define a motivic Fourier transformation for which we get…

Functional ANOVA offers a principled framework for interpretability by decomposing a model's prediction into main effects and higher-order interactions. For independent features, this decomposition is well-defined, strongly linked with SHAP…

We formulate a framework for describing behaviour of effectful higher-order recursive programs. Examples of effects are implemented using effect operations, and include: execution cost, nondeterminism, global store and interaction with a…

The main purpose of this work is to characterize derivations through functional equations. This work consists of five chapters. In the first one, we summarize the most important notions and results from the theory of functional equations.…

This article shows a correspondence between abstract interpretation of imperative programs and the refinement calculus: in the refinement calculus, an abstract interpretation of a program is a specification which is a function. This…

Functional integrals are defined in terms of locally compact topological groups and their associated Banach-valued Haar integrals. This approach generalizes the functional integral scheme of Cartier and DeWitt-Morette. The definition allows…

We show that intuitionistic propositional logic is \emph{Carnap categorical}: the only interpretation of the connectives consistent with the intuitionistic consequence relation is the standard interpretation. This holds relative to the most…

The set E of functions f fulfilling some conditions is taken to be the definition domain of s-order integral operator J^s (iterative integral), first for any positive integer s and after for any positive s (fractional, transcendental {\pi}…

We begin by defining general hypergeometric functions over finite fields and obtaining a finite field analogue of a classical symmetry in their complex counterparts. We give a geometric proof for the symmetry by constructing isomorphisms…

We unify functional and logic programming by treating predicatesas functions equipped with their support: the set of inputs whose output is nonzero. Datalog, for instance, is a language of finitely supported boolean functions. Finite…

We introduce a variation on Barthe et al.'s higher-order logic in which formulas are interpreted as predicates over open rather than closed objects. This way, concepts which have an intrinsically functional nature, like continuity,…

A finitary propositional logic can be given an algebraic reading in two different ways: by translating formulas into equations and logical rules into quasi-equations, or by translating logical rules directly into equations. The former type…

We develop a novel formal theory of finite structures, based on a view of finite structures as a fundamental artifact of computing and programming, forming a common platform for computing both within particular finite structures, and in the…

We propose a definition of branching-type stationary stochastic processes on rooted trees and related definitions of hyper-positivity for functions on the unit circle and functions on the set of non-negative integers. We then obtain (1) a…

In this paper, I establish the categorical structure necessary to interpret dependent inductive and coinductive types. It is well-known that dependent type theories \`a la Martin-L\"of can be interpreted using fibrations. Modern theorem…

We define an enumerative function F(n,k,P,m) which is a generalization of binomial coefficients. Special cases of this function are also power function, factorials, rising factorials and falling factorials. The first section of the paper is…