Computing with Catalan Families

  title={Computing with Catalan Families},
  author={Paul Tarau},
  • Paul Tarau
  • Published in LATA 10 March 2014
  • Computer Science
We study novel arithmetic algorithms on a canonical number representation based on the Catalan family of combinatorial objects. For numbers corresponding to Catalan objects of low structural complexity our algorithms provide super-exponential gains while their average case complexity is within constant factors of their traditional counterparts. 
Computing with Catalan Families, Generically
We describe arithmetic algorithms on a canonical number representation based on the Catalan family of combinatorial objects specified as a Haskell type class.
A Generic Numbering System based on Catalan Families of Combinatorial Objects
Novel arithmetic algorithms on a canonical number representation based on the Catalan family of combinatorial objects provide super-exponential gains while their average and worst case complexity is within constant factors of their traditional counterparts.
The Arithmetic of Recursively Run-Length Compressed Natural Numbers
We study arithmetic properties of a new tree-based canonical number representation, recursively run-length compressed natural numbers, defined by applying recursively a run-length encoding of their
On Factorization as Bijection to Finite Sequences
We describe mechanisms to emulate multiplicative properties of prime numbers by connecting them to computationally simpler representations involving bijections from natural numbers to sequences and
Towards a generic view of primality through multiset decompositions of natural numbers
On a uniform representation of combinators, arithmetic, lambda terms and types
With sound unification and compact expression of combinatorial generation algorithms, logic programming is shown to conveniently host a declarative playground where interesting properties and behaviors emerge from the interaction of heterogenous but deeply connected computational objects.
Arithmetic and Boolean Operations on Recursively Run-Length Compressed Natural Numbers
  • Paul Tarau
  • Computer Science, Mathematics
    Sci. Ann. Comput. Sci.
  • 2014
This work designs arithmetic and boolean operations with recursively runlength compressed natural numbers that work a block of digits at a time and are limited only by the representation complexity of their operands, rather than their bitsizes, so operations on very large numbers exhibiting a regular structure become tractable.
A Logic Programming Playground for Lambda Terms, Combinators, Types and Tree-based Arithmetic Computations
A compressed de Bruijn representation oflambda terms is introduced and its bijections to standard representations facilitate derivation of size-proportionate ranking and unranking algorithms of lambda terms and their inferred simple types.


Arithmetic algorithms for hereditarily binary natural numbers
In a typed functional language, hereditarily binary numbers are defined by applying recursively run-length encoding of bijective base-2 digits to enable new algorithms that collapse the complexity of arithmetic computations by super-exponential factors.
Efficient Data Structure and Algorithms for Sparse Integers, Sets and Predicates
  • J. Vuillemin
  • Mathematics, Computer Science
    2009 19th IEEE Symposium on Computer Arithmetic
  • 2009
A natural number n ≫ 1 is constructed by trichotomyn = g + Xpd; Xp = 22p; 0 · g and the inequality of the following type is checked.
On computing with types
This work uses a Haskell type class describing the "axiomati-zation" of the shared structure present in System T's type language and natural numbers to derive an efficiently testable total ordering on types, isomorphic to the ordering of natural numbers.
What Is Enumerative Combinatorics
The basic problem of enumerative combinatorics is that of counting the number of elements of a finite set. Usually are given an infinite class of finite sets S i where i ranges over some index set I
Declarative modeling of finite mathematics
A main contribution of the paper is a fully constructive unification of paradigms - a chain of type classes does it all: Peano arithmetic, sets, sequences, binary trees, bitstrings.
On the Restricted Ordinal Theorem
Gentzen proves the theorem of transfinite induction, which he requires, by an intuitive argument, by utilising transfinitely induction to prove that certain sequences of reduction processes, enumerated by ordinals less than e, are finite.
Mathematics and Computer Science: Coping with Finiteness
The distinction between finite and infinite is not as relevant as the distinction between realistic and unrealistic, and in many cases there are subtle ways to solve very large problems quickly, in spite of the fact that they appear at first to require examination of too many possibilities.
The On-Line Encyclopedia of Integer Sequences
  • N. Sloane
  • Computer Science
    Electron. J. Comb.
  • 1994
The On-Line Encyclopedia of Integer Sequences (or OEIS) is a database of some 130000 number sequences which serves as a dictionary, to tell the user what is known about a particular sequence and is widely used.
Formal languages I
Find the secret to improve the quality of life by reading this formal languages by knowing who the author is, how well-known the work is, and so on.
Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming
This volume contains the papers presented at PPDP 2010, the 12th International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming, held in Hagenberg, Austria, 26--28 July