Results 271 to 280 of about 148,259 (301)
Some of the next articles are maybe not open access.
Proceedings of the third ACM SIGPLAN international conference on Functional programming, 1998
Arity raising, also known as variable splitting or flattening, is the program optimization which transforms a function of one argument into a function of several arguments by decomposing the structure of the original one argument into individual components in that structure.
John Hannan, Patrick Hicks
openaire +1 more source
Arity raising, also known as variable splitting or flattening, is the program optimization which transforms a function of one argument into a function of several arguments by decomposing the structure of the original one argument into individual components in that structure.
John Hannan, Patrick Hicks
openaire +1 more source
A variable-arity procedural interface
Proceedings of the 1988 ACM conference on LISP and functional programming, 1988This paper presents a procedural interface that handles optional arguments and indefinite numbers of arguments in a convenient and efficient manner without resorting to storing the arguments in a language-dependent data structure. This interface solves many of the problems inherent in the use of lists to store indefinite numbers of arguments.
R. Kent Dybvig, Robert Hieb
openaire +1 more source
Finite Symmetric Functions with Non-Trivial Arity Gap
Given an n-ary k-valued function f, gap(f) denotes the essential arity gap of f which is the minimal number of essential variables in f which become fictive when identifying any two distinct essential variables in f. In the present paper we study the properties of the symmetric function with non-trivial arity gap (2 ≤ gap(f)).
Shtrakov, Slavcho, Koppitz, Jörg
exaly +4 more sources
Abstract Starting from concerns expressed by Hume, Russell, and Wittgenstein, and an analysis of the notion of relational arity, we develop an argument to the effect that any relation between objects that relates every object to itself and no object to any other must be a unary relation, i.e. a property.
Ulrich Pardey, Kai F Wehmeier
exaly +2 more sources
Ulrich Pardey, Kai F Wehmeier
exaly +2 more sources
Concrete Dualities and Essential Arities
2014 IEEE 44th International Symposium on Multiple-Valued Logic, 2014Many dualities arise in the same way: they are induced by dualizing objects. We show that these dualities are connected to a question occurring in universal algebra. Indeed, they cause a strong interplay between the essential arity of finitary operations in one category and the concrete form of the copowers in the other. We elaborate on this connection
openaire +1 more source
Expressibility of Fixed-Arity Languages
2012Chapter 3 studies the expressive power of various classes of valued constraints. It contains several results of the following form: let \(\mathcal{C}\) be a class of valued constraints with functions of unbounded arities; then \(\mathcal{C}\) can be expressed by a subset of \(\mathcal{C}\) consisting of valued constraints with functions of a fixed ...
openaire +1 more source
Computational aspects of arity hierarchies
1997The logics LFP (least fixed point logic), SO (second order logic), and PFP (partial fixed point logic), are known to capture the complexity classes PTIME, PH, and PSPACE respectively. We investigate hierarchies within these logics which emerge from imposing boundaries on the arities of second order variables.
openaire +2 more sources
A new approach to the fuzzification of arity, JHC and CUP of L-convexities
Journal of Intelligent & Fuzzy Systems, 2018Fan-Hong Chen, Chong Shen, F. Shi̇
semanticscholar +1 more source

