scholarly journals The Theory of Higher-Order Types of Asymptotic Variation for Differentiable Functions. Part I: Higher-Order Regular, Smooth and Rapid Variation

2016 ◽  
Vol 06 (12) ◽  
pp. 776-816 ◽  
Author(s):  
Antonio Granata
Keyword(s):  
Higher Order ◽  
Rapid Variation ◽  
Differentiable Functions ◽  
Order Types

scholarly journals Simpson type inequalities and applications

2021 ◽  
Author(s):  
Muhammad Uzair Awan ◽  
Muhammad Zakria Javed ◽  
Michael Th. Rassias ◽  
Muhammad Aslam Noor ◽  
Khalida Inayat Noor
Keyword(s):  
Quadrature Formula ◽  
Convex Functions ◽  
Integral Identity ◽  
Higher Order ◽  
Auxiliary Result ◽  
First Order ◽  
New Class ◽  
Differentiable Functions

AbstractA new generalized integral identity involving first order differentiable functions is obtained. Using this identity as an auxiliary result, we then obtain some new refinements of Simpson type inequalities using a new class called as strongly (s, m)-convex functions of higher order of $$\sigma >0$$ σ > 0 . We also discuss some interesting applications of the obtained results in the theory of means. In last we present applications of the obtained results in obtaining Simpson-like quadrature formula.

Sound and complete models of contracts

2006 ◽  
Vol 16 (4-5) ◽  
pp. 375-414 ◽  
Author(s):  
MATTHIAS BLUME ◽  
DAVID McALLESTER
Keyword(s):  
Ad Hoc ◽  
Expressive Power ◽  
Higher Order ◽  
Original Version ◽  
Order Types ◽  
Restricted Form ◽  
Soundness And Completeness ◽  
Recursive Contracts ◽  
Intuitive Interpretation ◽  
Typed Languages

Even in statically typed languages it is useful to have certain invariants checked dynamically. Findler and Felleisen gave an algorithm for dynamically checking expressive higher-order types called contracts. They did not, however, give a semantics of contracts. The lack of a semantics makes it impossible to define and prove soundness and completeness of the checking algorithm. (Given a semantics, a sound checker never reports violations that do not exist under that semantics; a complete checker is – in principle – able to find violations when violations exist.) Ideally, a semantics should capture what programmers intuitively feel is the meaning of a contract or otherwise clearly point out where intuition does not match reality. In this paper we give an interpretation of contracts for which we prove the Findler-Felleisen algorithm sound and (under reasonable assumptions) complete. While our semantics mostly matches intuition, it also exposes a problem with predicate contracts where an arguably more intuitive interpretation than ours would render the checking algorithm unsound. In our semantics we have to make use of a notion of safety (which we define in the paper) to avoid unsoundness. We are able to eliminate the “leakage” of safety into the semantics by changing the language, replacing the original version of unrestricted predicate contracts with a restricted form. The corresponding loss in expressive power can be recovered by making safety explicit as a contract. This can be done either in ad-hoc fashion or by including general recursive contracts. The addition of recursive contracts has far-reaching implications, deeply affecting the formulation of our model and requiring different techniques for proving soundness.

scholarly journals The complexity of type inference for higher-order typed lambda calculi

1994 ◽  
Vol 4 (4) ◽  
pp. 435-477 ◽  
Author(s):  
Fritz Henglein ◽  
Harry G. Mairson
Keyword(s):  
Lower Bounds ◽  
Higher Order ◽  
Type Inference ◽  
Boolean Logic ◽  
Turing Machines ◽  
Technical Tool ◽  
Inference Problem ◽  
Exponential Time ◽  
First Order ◽  
Order Types

AbstractWe analyse the computational complexity of type inference for untyped λ-terms in the second-order polymorphic typed λ-calculus (F2) invented by Girard and Reynolds, as well as higher-order extensions F3, F4, …, Fω proposed by Girard. We prove that recognising the F2-typable terms requires exponential time, and for Fω the problem is non-elementary. We show as well a sequence of lower bounds on recognising the Fk-typable terms, where the bound for Fk+1 is exponentially larger than that for Fk.The lower bounds are based on generic simulation of Turing Machines, where computation is simulated at the expression and type level simultaneously. Non-accepting computations are mapped to non-normalising reduction sequences, and hence non-typable terms. The accepting computations are mapped to typable terms, where higher-order types encode reduction sequences, and first-order types encode the entire computation as a circuit, based on a unification simulation of Boolean logic. A primary technical tool in this reduction is the composition of polymorphic functions having different domains and ranges.These results are the first nontrivial lower bounds on type inference for the Girard/Reynolds system as well as its higher-order extensions. We hope that the analysis provides important combinatorial insights which will prove useful in the ultimate resolution of the complexity of the type inference problem.

scholarly journals On the Versatility of Open Logical Relations

2020 ◽  
pp. 56-83 ◽  
Author(s):  
Gilles Barthe ◽  
Raphaëlle Crubillé ◽  
Ugo Dal Lago ◽  
Francesco Gavazzo
Keyword(s):  
Programming Languages ◽  
Automatic Differentiation ◽  
Type System ◽  
Order Type ◽  
Higher Order ◽  
Base Case ◽  
Logical Relation ◽  
First Order ◽  
Differentiable Functions ◽  
The One

AbstractLogical relations are one among the most powerful techniques in the theory of programming languages, and have been used extensively for proving properties of a variety of higher-order calculi. However, there are properties that cannot be immediately proved by means of logical relations, for instance program continuity and differentiability in higher-order languages extended with real-valued functions. Informally, the problem stems from the fact that these properties are naturally expressed on terms of non-ground type (or, equivalently, on open terms of base type), and there is no apparent good definition for a base case (i.e. for closed terms of ground types). To overcome this issue, we study a generalization of the concept of a logical relation, called open logical relation, and prove that it can be fruitfully applied in several contexts in which the property of interest is about expressions of first-order type. Our setting is a simply-typed $$\lambda $$ λ -calculus enriched with real numbers and real-valued first-order functions from a given set, such as the one of continuous or differentiable functions. We first prove a containment theorem stating that for any collection of real-valued first-order functions including projection functions and closed under function composition, any well-typed term of first-order type denotes a function belonging to that collection. Then, we show by way of open logical relations the correctness of the core of a recently published algorithm for forward automatic differentiation. Finally, we define a refinement-based type system for local continuity in an extension of our calculus with conditionals, and prove the soundness of the type system using open logical relations.

scholarly journals Liftings of Some Types of Tensor Fields and Connections to Tangent Bundles of pr-Velocities

1970 ◽  
Vol 40 ◽  
pp. 13-31 ◽  
Author(s):  
Akihiko Morimoto
Keyword(s):  
Vector Fields ◽  
Higher Order ◽  
Tensor Fields ◽  
Multi Index ◽  
Differentiable Functions ◽  
Tangent Bundles

In the previous paper [6], we studied the liftings of tensor fields to tangent bundles of higher order. The purpose of the present paper is to generalize the results of [6] to the tangent bundles of pr-velocities in a manifold M— notions due to C. Ehresmann [1] (see also [2]). In §1, we explain the pr-velocities in a manifold and define the (Λ)-lifting of differentiable functions for any multi-index λ -(λ1, λ2,…,λp) of non-negative integers λi satisfying ΣΛi≤r. In § 2, we construct ‹Λ›-lifts of any vector fields and ‹Λ›-lifts of 1-forms. The ‹Λ›-lift is a little bit different from the ‹Λ›-lift of vector fields in [6].

Sign in / Sign up

Export Citation Format

Share Document