A General Method for the Proof of Theorems on Tail-recursive Functions
نویسنده
چکیده
Tail-recursive function definitions are sometimes more straightforward than alternatives, but proving theorems on them may be roundabout because of the peculiar form of the resulting recursion induction rules. This paper describes a proof method that provides a general solution to this problem by means of suitable invariants over inductive sets, and illustrates the application of such method by examining two case studies.
منابع مشابه
Diagonal arguments and fixed points
A universal schema for diagonalization was popularized by N.S. Yanofsky (2003), based on a pioneering work of F.W. Lawvere (1969), in which the existence of a (diagonolized-out and contradictory) object implies the existence of a fixed-point for a certain function. It was shown that many self-referential paradoxes and diagonally proved theorems can fit in that schema. Here, we fi...
متن کاملConsumption-Based Asset Pricing with Recursive Utility
In this paper it has been attempted to investigate the capability of the consumption-based capital asset pricing model (CCAPM), using the general method of moment (GMM), with regard to the Epstien-zin recursive preferences model for Iran's capital market. Generally speaking, recursive utility permits disentangling of the two psychologically separate concepts of risk aversion and elasticity of i...
متن کاملRamsey's Theorem for Pairs and Provably Recursive Functions
This paper addresses the strength of Ramsey’s theorem for pairs (RT2) over a weak base theory from the perspective of ‘proof mining’. Let RT2− 2 denote Ramsey’s theorem for pairs where the coloring is given by an explicit term involving only numeric variables. We add this principle to a weak base theory that includes weak König’s lemma and a substantial amount of Σ1-induction (enough to prove t...
متن کاملExponential Bounds and Tails for Additive Random Recursive Sequences
Exponential bounds and tail estimates are derived for additive random recursive sequences, which typically arise as functionals of recursive structures, of random trees or in recursive algorithms. In particular they arise as parameters of divide and conquer type algorithms. We derive tail bounds from estimates of the Laplace transforms and of the moment sequences. For the proof we use some clas...
متن کاملKarlin’s Basic Composition Theorems and Stochastic Orderings
Suppose λ,x,ζ traverse the ordered sets Λ, X and Z, respectively and consider the functions f(λ,x,ζ) and g(λ,ζ) satisfying the following conditions, (a) f(λ,x,ζ) > 0 and f is TP2 in each pairs of variables when the third variable is held fixed and (b) g(λ,ζ) is TP2. Then the function h(λ,x) =∫Z f(λ,x,ζ)g(λ,ζ)dµ(ζ), defined on Λ×X is TP2 in (λ,x). The aim of this note is to use a new stochast...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Archive of Formal Proofs
دوره 2013 شماره
صفحات -
تاریخ انتشار 2013