Results 11 to 20 of about 148,259 (301)
An Invitation to Higher Arity Science [PDF]
Complex Systems, 2022 Analytical thinking is dominated by binary ideas. From pairwise interactions to algebraic operations, to compositions of processes, to network models, binary structures are deeply ingrained in the fabric of most current scientific paradigms. In this paper, we introduce arity as the generic conceptualization of the order of an interaction between a ...
Zapata-Carratala, Carlos +1 more
openaire +3 more sources
Practical Variable-Arity Polymorphism [PDF]
ACM SIGPLAN Lisp Pointers, 2009 Just as some functions have uniform behavior over distinct types, other functions have uniform behavior over distinct arities. These variable-arity functions are widely used in scripting languages such as Scheme and Python. Statically typed languages also accommodate modest forms of variable-arity functions, but even ML and Haskell, languages with ...
T. Stephen Strickland +2 more
semanticscholar +3 more sources
Arity-generic datatype-generic programming [PDF]
Proceedings of the 4th ACM SIGPLAN workshop on Programming languages meets program verification, 2010 Some programs are doubly-generic. For example, map is datatype-generic in that many different data structures support a mapping operation. A generic programming language like Generic Haskell can use a single definition to generate map for each type. However, map is also arity-generic because it belongs to a family of related operations that differ in ...
Stephanie Weirich, Chris Casinghino
semanticscholar +3 more sources
The minimal arity of near unanimity polymorphisms [PDF]
Mathematica Slovaca, 2019 Abstract Dmitriy Zhuk has proved that there exist relational structures which admit near unanimity polymorphisms, but the minimum arity of such a polymorphism is large and almost matches the known upper bounds. We present a simplified and explicit construction of such structures and a detailed, self–contained proof.
Barto, Libor, Draganov, Ondřej
openaire +4 more sources
The Arity Hierarchy in the Polyadic μ-Calculus [PDF]
Electronic Proceedings in Theoretical Computer Science, 2015 The polyadic mu-calculus is a modal fixpoint logic whose formulas define relations of nodes rather than just sets in labelled transition systems. It can express exactly the polynomial-time computable and bisimulation-invariant queries on finite graphs ...
Martin Lange
doaj +3 more sources
Proceedings of the 2018 World Wide Web Conference on World Wide Web - WWW '18, 2018 Text-based knowledge extraction methods for populating knowledge bases have focused on binary facts: relationships between two entities. However, in advanced domains such as health, it is often crucial to consider ternary and higher-arity relations. An example is to capture which drug is used for which disease at which dosage (e.g.
Ernst, P., Siu, A., Weikum, G.
openaire +3 more sources
Faster black-box algorithms through higher arity operators [PDF]
Proceedings of the 11th workshop proceedings on Foundations of genetic algorithms, 2011 To appear at FOGA ...
Doerr, B. +5 more
openaire +5 more sources
Reducing the Arity in Unbiased Black-Box Complexity [PDF]
Annual Conference on Genetic and Evolutionary Computation, 2012 We show that for all ...
Doerr, Benjamin, Winzen, Carola
core +2 more sources
High-arity PAC learning via exchangeability
arXiv.org151 pages, 1 figure. (Minor changes: this version changes the definition of flexibility (3.17 and 4.14) to a weaker one to ensure that the 0/1-loss is flexible, fixing an imprecision in Lemma 3.19; see Footnote 34 in the manuscript for details.)
Coregliano, Leonardo N. +1 more
openaire +3 more sources
Applied Categorical Structures, 2021 We specialise a recently introduced notion of generalised dinaturality for functors $T : (\mathcal{C}^\text{op})^p \times \mathcal{C}^q \to \mathcal{D}$ to the case where the domain (resp., codomain) is constant, obtaining notions of ends (resp., coends) of higher arity, dubbed herein $(p,q)$-ends (resp., $(p,q)$-coends). While higher arity co/ends are
Fosco Loregian, Emily de Oliveira Santos
openaire +3 more sources