Categorical data types in parametric polymorphism

1994 ◽  
Vol 4 (1) ◽  
pp. 71-109 ◽  
Author(s):  
Ryu Hasegawa
Keyword(s):  
Categorical Data ◽  
Lambda Calculus ◽  
Second Order ◽  
Necessary Condition ◽  
Data Types ◽  
Parametric Polymorphism ◽  
Universal Properties ◽  
Sufficient And Necessary Condition

The categorical data types in models of second order lambda calculus are studied. We prove that Reynolds parametricity is a sufficient and necessary condition for the categorical data types to fulfill the universal properties.

scholarly journals Parametric polymorphism and operational equivalence

2000 ◽  
Vol 10 (3) ◽  
pp. 321-359 ◽  
Author(s):  
ANDREW M. PITTS
Keyword(s):  
Programming Language ◽  
Functional Programming ◽  
Closure Operator ◽  
Lambda Calculus ◽  
Logical Relation ◽  
Data Types ◽  
Mathematical Properties ◽  
Parametric Polymorphism ◽  
Operational Behaviour

Studies of the mathematical properties of impredicative polymorphic types have for the most part focused on the polymorphic lambda calculus of Girard–Reynolds, which is a calculus of total polymorphic functions. This paper considers polymorphic types from a functional programming perspective, where the partialness arising from the presence of fixpoint recursion complicates the nature of potentially infinite (‘lazy’) data types. An approach to Reynolds' notion of relational parametricity is developed that works directly on the syntax of a programming language, using a novel closure operator to relate operational behaviour to parametricity properties of types. Working with an extension of Plotkin's PCF with ∀-types, lazy lists and existential types, we show by example how the resulting logical relation can be used to prove properties of polymorphic types up to operational equivalence.

scholarly journals Consensus of Second-Order Multiagent Systems with Fixed Topology and Time-Delay

2015 ◽  
Vol 2015 ◽  
pp. 1-6 ◽  
Author(s):  
Xue Li ◽  
Huai Wu ◽  
Yikang Yang
Keyword(s):  
Time Delay ◽  
Graph Laplacian ◽  
Second Order ◽  
Necessary Condition ◽  
Frequency Domain Method ◽  
Position Information ◽  
Eigenvalue Method ◽  
Fixed Topology ◽  
Sufficient And Necessary Condition ◽  
Relative Position Information

We are concerned with the consensus problems for networks of second-order agents, where each agent can only access the relative position information from its neighbours. We aim to find the largest tolerable input delay such that the system consensus can be reached. We introduce a protocol with time-delay and fixed topology. A sufficient and necessary condition is given to guarantee the consensus. By using eigenvector-eigenvalue method and frequency domain method, it is proved that the largest tolerable time-delay is only related to the eigenvalues of the graph Laplacian. And simulation results are also provided to demonstrate the effectiveness of our theoretical results.

scholarly journals Second-Order Leader-Following Consensus of Multiagent Systems with Time Delays

2013 ◽  
Vol 2013 ◽  
pp. 1-8 ◽  
Author(s):  
Hong Xia ◽  
Ting-Zhu Huang ◽  
Jin-Liang Shao ◽  
Jun-Yan Yu
Keyword(s):  
Multiagent Systems ◽  
Time Delays ◽  
Second Order ◽  
Switching Topology ◽  
Necessary Condition ◽  
Constant Acceleration ◽  
Leader Following ◽  
Fixed Topology ◽  
Sufficient And Necessary Condition ◽  
Theoretical Results

This paper is concerned with a leader-following consensus problem of second-order multiagent systems with a constant acceleration leader and time-varying delays. At first, a distributed control protocol for every agent to track the leader is proposed; then by utilizing the Lyapunov-Razumikhin function, the convergence analysis under both fixed and switching interconnection topologies is investigated. For the case of fixed topology, a sufficient and necessary condition is obtained, and for the case of switching topology, a sufficient condition is derived under some assumptions. Finally, simulation examples are provided to demonstrate the effectiveness of the theoretical results.

scholarly journals Cauchy matrix and Liouville formula of quaternion impulsive dynamic equations on time scales

2020 ◽  
Vol 18 (1) ◽  
pp. 353-377 ◽  
Author(s):  
Zhien Li ◽  
Chao Wang
Keyword(s):  
Time Scales ◽  
Quaternion Algebra ◽  
Matrix Exponential ◽  
Dynamic Equations ◽  
Necessary Condition ◽  
Quaternion Matrix ◽  
Exponential Functions ◽  
Cauchy Matrix ◽  
Adjoint Matrix ◽  
Sufficient And Necessary Condition

Abstract In this study, we obtain the scalar and matrix exponential functions through a series of quaternion-valued functions on time scales. A sufficient and necessary condition is established to guarantee that the induced matrix is real-valued for the complex adjoint matrix of a quaternion matrix. Moreover, the Cauchy matrices and Liouville formulas for the quaternion homogeneous and nonhomogeneous impulsive dynamic equations are given and proved. Based on it, the existence, uniqueness, and expressions of their solutions are also obtained, including their scalar and matrix forms. Since the quaternion algebra is noncommutative, many concepts and properties of the non-quaternion impulsive dynamic equations are ineffective, we provide several examples and counterexamples on various time scales to illustrate the effectiveness of our results.

scholarly journals The Limits of Computation

Axiomathes ◽  
2021 ◽  
Author(s):  
Andrew Powell
Keyword(s):  
Natural Number ◽  
Set Theory ◽  
Lambda Calculus ◽  
Second Order ◽  
Functional Interpretation ◽  
Arbitrary Type ◽  
Computable Functions

AbstractThis article provides a survey of key papers that characterise computable functions, but also provides some novel insights as follows. It is argued that the power of algorithms is at least as strong as functions that can be proved to be totally computable in type-theoretic translations of subsystems of second-order Zermelo Fraenkel set theory. Moreover, it is claimed that typed systems of the lambda calculus give rise naturally to a functional interpretation of rich systems of types and to a hierarchy of ordinal recursive functionals of arbitrary type that can be reduced by substitution to natural number functions.

scholarly journals Sufficient and necessary conditions for oscillation of linear fractional-order delay differential equations

2021 ◽  
Vol 2021 (1) ◽  
Author(s):  
Qiong Meng ◽  
Zhen Jin ◽  
Guirong Liu
Keyword(s):  
Differential Equation ◽  
Fractional Order ◽  
Sufficient Conditions ◽  
Necessary Condition ◽  
Multiple Delays ◽  
All Solutions ◽  
Sufficient And Necessary Conditions ◽  
Delay Differential ◽  
T Tau ◽  
Sufficient And Necessary Condition

AbstractThis paper studies the linear fractional-order delay differential equation $$ {}^{C}D^{\alpha }_{-}x(t)-px(t-\tau )= 0, $$ D − α C x ( t ) − p x ( t − τ ) = 0 , where $0<\alpha =\frac{\text{odd integer}}{\text{odd integer}}<1$ 0 < α = odd integer odd integer < 1 , $p, \tau >0$ p , τ > 0 , ${}^{C}D_{-}^{\alpha }x(t)=-\Gamma ^{-1}(1-\alpha )\int _{t}^{\infty }(s-t)^{- \alpha }x'(s)\,ds$ D − α C x ( t ) = − Γ − 1 ( 1 − α ) ∫ t ∞ ( s − t ) − α x ′ ( s ) d s . We obtain the conclusion that $$ p^{1/\alpha } \tau >\alpha /e $$ p 1 / α τ > α / e is a sufficient and necessary condition of the oscillations for all solutions of Eq. (*). At the same time, some sufficient conditions are obtained for the oscillations of multiple delays linear fractional differential equation. Several examples are given to illustrate our theorems.

scholarly journals Research on the Relationship between Shared Leadership and Individual Creativity-Qualitative Comparative Analysis on the Basis of Clear Set

2021 ◽  
Vol 13 (10) ◽  
pp. 5445
Author(s):  
Muyun Sun ◽  
Jigan Wang ◽  
Ting Wen
Keyword(s):  
Comparative Analysis ◽  
Environmental Factors ◽  
Shared Leadership ◽  
Management Practices ◽  
Qualitative Comparative Analysis ◽  
Necessary Condition ◽  
The Individual ◽  
The Impact ◽  
The Relationship ◽  
Sufficient And Necessary Condition

Creativity is the key to obtaining and maintaining competitiveness of modern organizations, and it has attracted much attention from academic circles and management practices. Shared leadership is believed to effectively influence team output. However, research on the impact of individual creativity is still in its infancy. This study adopts the qualitative comparative analysis method, taking 1584 individuals as the research objects, underpinned by a questionnaire-based survey. It investigates the influence of the team’s shared leadership network elements and organizational environmental factors on the individual creativity. We have found that there are six combination of conditions of shared leadership and organizational environmental factors constituting sufficient combination of conditions to increase or decrease individual creativity. Moreover, we have noticed that the low network density of shared leadership is a sufficient and necessary condition of reducing individual creativity. Our results also provide management suggestions for practical activities during the team management.

scholarly journals A nonlocal game for witnessing quantum networks

2019 ◽  
Vol 5 (1) ◽  
Author(s):  
Ming-Xing Luo
Keyword(s):  
Computational Complexity ◽  
Main Idea ◽  
Bell Inequalities ◽  
Theoretical Computer Science ◽  
Graph Representation ◽  
Necessary Condition ◽  
Quantum Networks ◽  
Theoretical Computer ◽  
Sufficient And Necessary Condition ◽  
Unified Method

Abstract Nonlocal game as a witness of the nonlocality of entanglement is of fundamental importance in various fields. The well-known nonlocal games or equivalent linear Bell inequalities are only useful for Bell networks consisting of single entanglement. Our goal in this paper is to propose a unified method for constructing cooperating games in network scenarios. We propose an efficient method to construct multipartite nonlocal games from any graphs. The main idea is the graph representation of entanglement-based quantum networks. We further specify these graphic games with quantum advantages by providing a simple sufficient and necessary condition. The graphic games imply a linear Bell testing of the nonlocality of general quantum networks consisting of EPR states. It also allows generating new instances going beyond CHSH game. These results have interesting applications in quantum networks, Bell theory, computational complexity, and theoretical computer science.

New characterizations of g-frames and g-Riesz bases

2018 ◽  
Vol 16 (06) ◽  
pp. 1850053 ◽  
Author(s):  
Dongwei Li ◽  
Jinsong Leng ◽  
Tingzhu Huang
Keyword(s):  
Riesz Basis ◽  
Riesz Bases ◽  
Gram Matrix ◽  
Necessary Condition ◽  
Topological Properties ◽  
Bessel Sequence ◽  
Bessel Sequences ◽  
Sufficient And Necessary Condition

In this paper, we give some new characterizations of g-frames, g-Bessel sequences and g-Riesz bases from their topological properties. By using the Gram matrix associated with the g-Bessel sequence, we present a sufficient and necessary condition under which the sequence is a g-Bessel sequence (or g-Riesz basis). Finally, we consider the excess of a g-frame and obtain some new results.

A SUFFICIENT AND NECESSARY CONDITION FOR CREDIBILITY MEASURES

2006 ◽  
Vol 14 (05) ◽  
pp. 527-535 ◽  
Author(s):  
XIANG LI ◽  
BAODING LIU
Keyword(s):  
Set Theory ◽  
Fuzzy Set ◽  
Fuzzy Set Theory ◽  
Extension Theorem ◽  
The Self ◽  
Necessary Condition ◽  
Self Duality ◽  
Duality Property ◽  
Sufficient And Necessary Condition

Possibility measures and credibility measures are widely used in fuzzy set theory. Compared with possibility measures, the advantage of credibility measures is the self-duality property. This paper gives a relation between possibility measures and credibility measures, and proves a sufficient and necessary condition for credibility measures. Finally, the credibility extension theorem is shown.

Sign in / Sign up

Export Citation Format

Share Document