We consider a term sequent logic for the lambda-calculus. Term sequents are a judgement form similar to the logical judgement form of entailment between sentences, but denoting equality or reducibility between terms. Using term sequents, it is possible to treat lambda-terms almost like logical sentences, and to use proof-theoretic methods to establish their properties. We prove a cut-eliminatio...

This paper studies stability aspects of solutions of parametric mathematical programs and generalized equations, respectively, with disjunctive constraints. We present sufficient conditions that, under some constraint qualifications ensuring metric subregularity of the constraint mapping, continuity results of upper Lipschitz and upper Hölder type, respectively, hold. Furthermore, we apply the ...

Two mixed symmetric dual models for a class of non-differentiable multiobjective nonlinear programming problems with multiple arguments are introduced in this paper. These two mixed symmetric dual models unify the four existing multiobjective symmetric dual models in the literature. Weak and strong duality theorems are established for these models under some mild assumptions of generalized conv...

Studying a critical value function φ in parametric nonlinear programming, we recall conditions guaranteeing that φ is a C function and derive second order Taylor expansion formulas including second-order terms in the form of certain generalized derivatives of Dφ. Several specializations and applications are discussed. These results are understood as supplements to the well–developed theory of f...

This paper studies stability aspects of solutions of parametric mathematical programs and generalized equations, respectively, with disjunctive constraints. We present sufficient conditions that, under some constraint qualifications ensuring metric subregularity of the constraint mapping, continuity results of upper Lischitz and upper Hölder type, respectively, hold. Furthermore, we apply the a...

the concepts of structural optimization was introduced about sixty years ago. smiths from the university of los angeles (california) for the first time has offered the combination of finite element method and optimization techniques to design optimum structures (1960). at present time, this techniques are generally understood and many softwares for this perpose have been developed. in this pape...

Are higher-order extensions to logic programming needed? We answer this question in the negative by showing that higher-order features are already available in pure logic programming. It is demonstrated that higher-order lambda calculus-based languages can be compositionally embedded in logic programming languages preserving their semantics and abstraction facilities. Further, we show that such...