DeepAI AI Chat
Log In Sign Up

Unboundedness for Recursion Schemes: A Simpler Type System

by   David Barozzini, et al.

Decidability of the problems of unboundedness and simultaneous unboundedness (aka. the diagonal problem) for higher-order recursion schemes was established by Clemente, Parys, Salvati, and Walukiewicz (2016). Then a procedure of optimal complexity was presented by Parys (2017); this procedure used a complicated type system, involving multiple flags and markers. We present here a simpler and much more intuitive type system serving the same purpose. We prove that this type system allows to solve the unboundedness problem for a widely considered subclass of recursion schemes, called safe schemes. For unsafe recursion schemes we only have soundness of the type system: if one can establish a type derivation claiming that a recursion scheme is unbounded then it is indeed unbounded. Completeness of the type system for unsafe recursion schemes is left as an open question. Going further, we discuss an extension of the type system that allows to handle the simultaneous unboundedness problem. We also design and implement an algorithm that fully automatically checks unboundedness of a given recursion scheme, completing in a short time for a wide variety of inputs.


page 1

page 3

page 9

page 11

page 13

page 17


On higher order passivity preserving schemes for nonlinear Maxwell's equations

We present two strategies for designing passivity preserving higher orde...

Simple Type Theory is not too Simple: Grothendieck's Schemes without Dependent Types

We report on a formalization of schemes in the proof assistant Isabelle/...

Recursion Schemes, the MSO Logic, and the U quantifier

We study the model-checking problem for recursion schemes: does the tree...

An Unbounded Fully Homomorphic Encryption Scheme Based on Ideal Lattices and Chinese Remainder Theorem

We propose an unbounded fully homomorphic encryption scheme, i.e. a sche...

A New Stability Approach for Positivity-Preserving Patankar-type Schemes

Patankar-type schemes are linearly implicit time integration methods des...

On Higher-Order Cryptography (Long Version)

Type-two constructions abound in cryptography: adversaries for encryptio...

Simultaneous adaptation to the margin and to complexity in classification

We consider the problem of adaptation to the margin and to complexity in...