DeepAI AI Chat
Log In Sign Up

Typed lambda-calculi and superclasses of regular functions

by   Lê Thành Dũng Nguyên, et al.

We propose to use Church encodings in typed lambda-calculi as the basis for an automata-theoretic counterpart of implicit computational complexity, in the same way that monadic second-order logic provides a counterpart to descriptive complexity. Specifically, we look at transductions i.e. string-to-string (or tree-to-tree) functions - in particular those with superlinear growth, such as polyregular functions, HDT0L transductions and Sénizergues's "k-computable mappings". Our first results towards this aim consist showing the inclusion of some transduction classes in some classes defined by lambda-calculi. In particular, this sheds light on a basic open question on the expressivity of the simply typed lambda-calculus. We also encode regular functions (and, by changing the type of programs considered, we get a larger subclass of polyregular functions) in the elementary affine lambda-calculus, a variant of linear logic originally designed for implicit computational complexity.


page 1

page 2

page 3

page 4


Implicit automata in typed λ-calculi II: streaming transducers vs categorical semantics

We characterize regular string transductions as programs in a linear λ-c...

On the Elementary Affine Lambda-Calculus with and Without Fixed Points

The elementary affine lambda-calculus was introduced as a polyvalent set...

Probabilistic Soft Type Assignment

We model randomized complexity classes in the style of Implicit Computat...

Growth Functions, Rates and Classes of String-Based Multiway Systems

In context of the Wolfram Physics Project, a certain class of abstract r...

Around finite second-order coherence spaces

Many applications of denotational semantics, such as higher-order model ...

Folding interpretations

We study the polyregular string-to-string functions, which are certain f...

Revisiting the growth of polyregular functions: output languages, weighted automata and unary inputs

Polyregular functions are the class of string-to-string functions defina...