Add to ORKGAbstract. Structural recursion over sets is meaningful only if the result is independent of the order in which the set’s elements are enumerated. This paper outlines a theory of function definition for finite sets, based on the fold functionals often used with lists. The fold functional is introduced as a relation, which is then shown to denote a function under certain conditions. Applications include summation and maximum. The theory has been formalized using Isabelle/HOL.
Recently, using a limit schema, we presented an analog and machine independent algebraic characteriz...
Abstract. In this paper we formally state and prove theorems charac-terizing when a function can be ...
Finite maps, functions defined on only a finite domain, occur often, particularly when reasoning abo...
In functional programming, fold is a standard operator that encapsulates a simple pattern of recursi...
We give a necessary and sufficient condition for when a set-theoretic function can be written using ...
We give a necessary and sufficient condition for when a set-theoretic function can be written using ...
We develop a novel formal theory of finite structures, based on a view of finite structures as a fun...
This document presents some definitions and theorems from elementary finite combinatorics. The defin...
Fold functions are a general mechanism for computing over recursive data structures. First-order fol...
A class of functions with a finite number of return values is defined over combinatorial structures....
none1noWe address computational complexity writing polymorphic functions between finite types (i.e.,...
Summary. In this paper we introduce sets containing number-valued func-tions. Different arithmetic o...
AbstractWe give a necessary and sufficient condition for when a set-theoretic function can be writte...
Gives an introduction to the theory of function algebras. This book gives the general concepts of th...
One style of functional programming is based purely on recursive equations. Such equations are easy ...
Recently, using a limit schema, we presented an analog and machine independent algebraic characteriz...
Abstract. In this paper we formally state and prove theorems charac-terizing when a function can be ...
Finite maps, functions defined on only a finite domain, occur often, particularly when reasoning abo...
In functional programming, fold is a standard operator that encapsulates a simple pattern of recursi...
We give a necessary and sufficient condition for when a set-theoretic function can be written using ...
We give a necessary and sufficient condition for when a set-theoretic function can be written using ...
We develop a novel formal theory of finite structures, based on a view of finite structures as a fun...
This document presents some definitions and theorems from elementary finite combinatorics. The defin...
Fold functions are a general mechanism for computing over recursive data structures. First-order fol...
A class of functions with a finite number of return values is defined over combinatorial structures....
none1noWe address computational complexity writing polymorphic functions between finite types (i.e.,...
Summary. In this paper we introduce sets containing number-valued func-tions. Different arithmetic o...
AbstractWe give a necessary and sufficient condition for when a set-theoretic function can be writte...
Gives an introduction to the theory of function algebras. This book gives the general concepts of th...
One style of functional programming is based purely on recursive equations. Such equations are easy ...
Recently, using a limit schema, we presented an analog and machine independent algebraic characteriz...
Abstract. In this paper we formally state and prove theorems charac-terizing when a function can be ...
Finite maps, functions defined on only a finite domain, occur often, particularly when reasoning abo...