Results 21 to 30 of about 30,597 (268)
A principled approach to programming with nested types in Haskell [PDF]
, 2009 Initial algebra semantics is one of the cornerstones of the theory of modern functional programming languages. For each inductive data type, it provides a Church encoding for that type, a build combinator which constructs data of that type, a fold ...
Ghani, Neil, Johann, Patricia
core +4 more sources
Recursion in Recursion: Two-Level Nested Recursion for Length Generalization with Scalability
Advances in Neural Information Processing Systems 36, 2023 Binary Balanced Tree RvNNs (BBT-RvNNs) enforce sequence composition according to a preset balanced binary tree structure. Thus, their non-linear recursion depth is just $\log_2 n$ ($n$ being the sequence length). Such logarithmic scaling makes BBT-RvNNs efficient and scalable on long sequence tasks such as Long Range Arena (LRA).
Jishnu Ray Chowdhury, Cornelia Caragea
openaire +3 more sources
On bar recursion of types 0 and 1 [PDF]
, 1979 For general information on bar recursion the reader should consult the papers of Spector [8], where it was introduced, Howard [2] and Tait [11]. In this note we shall prove that the terms of Godel's theory T (in its extensional version of Spector [8]
HELMUT SCHWICHTENBERG +1 more
core +1 more source
A hierarchy of ramified theories below primitive recursive arithmetic [PDF]
, 2010 The arithmetical theory EA(I;O) developed by Çagman, Ostrin and Wainer ([18] and [48]) provides a formal setting for the variable separation of Bellantoni-Cook predicative recursion [6].
Spoors, Elliott John
core +5 more sources
Computability and Recursion [PDF]
Bulletin of Symbolic Logic, 1996 AbstractWe consider the informal concept of “computability” or “effective calculability” and two of the formalisms commonly used to define it, “(Turing)computability” and “(general)recursiveness”. We consider their origin, exact technical definition, concepts, history, general English meanings, how they became fixed in their present roles, how they ...
openaire +1 more source
A List of 1 + 1 Dimensional Integrable Equations and Their Properties [PDF]
, 2001 This paper contains a list of known integrable systems. It gives their recursion-, Hamiltonian-, symplectic- and cosymplectic operator, roots of their symmetries and their scaling ...
Jing Ping Wang, Wang, Jing Ping
core +1 more source
Integrable discretization of recursion operators and unified bilinear forms to soliton hierarchies [PDF]
Open Communications in Nonlinear Mathematical PhysicsIn this paper, we give a procedure for discretizing recursion operators by utilizing unified bilinear forms within integrable hierarchies. To illustrate this approach, we present unified bilinear forms for both the AKNS hierarchy and the KdV hierarchy ...
Xingbiao Hu, Guofu Yu, Yingnan Zhang
doaj +1 more source
Journal of High Energy Physics, 2023 Abstract We examine the BCFW recursion relations for celestial amplitudes and how they inform the celestial bootstrap program. We start by recasting the celestial incarnation of the BCFW shift as a generalization of the action of familiar asymptotic symmetries on hard particles, before focusing on two limits: z → ∞ and z → 0.
Yangrui Hu, Sabrina Pasterski
openaire +3 more sources
The Acquisition of Recursion: How Formalism Articulates the Child’s Path
Biolinguistics, 2011 We distinguish three kinds of recursion: Direct Recursion (which delivers a ‘conjunction’ reading), Indirect Recursion, and Generalized Transformations. The essential argument is that Direct Recursion captures the first stage of each recursive structure.
Tom W. Roeper
doaj +1 more source
Recursión, inducción y órdenes bien fundados
Revista Integración, 2011 Con base en la caracterización de los números naturales a partir de la propiedad de recursión (ver [2]), probamos en forma general que para un conjunto dado las propiedades de recursión, inducción y buena fundación son equivalentes entre sí.
Carlos Parra-Londoño +1 more
doaj +4 more sources