A Light Modality for Recursion

12/31/2017
by   Paula Severi, et al.
0

We investigate the interplay between a modality for controlling the behaviour of recursive functional programs on infinite structures which are completely silent in the syntax. The latter means that programs do not contain "marks" showing the application of the introduction and elimination rules for the modality. This shifts the burden of controlling recursion from the programmer to the compiler. To do this, we introduce a typed lambda calculus a la Curry with a silent modality and guarded recursive types. The typing discipline guarantees normalisation and can be transformed into an algorithm which infers the type of a program.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/31/2017

Two Light Modalities for Recursion

We investigate the interplay between two modalities for controlling the ...
research
01/23/2016

Undecidability of the Lambek calculus with a relevant modality

Morrill and Valentin in the paper "Computational coverage of TLG: Nonlin...
research
07/01/2021

Efficient Tree-Traversals: Reconciling Parallelism and Dense Data Representations

Recent work showed that compiling functional programs to use dense, seri...
research
05/13/2021

Circular Proofs as Processes: Type-Based Termination via Arithmetic Refinements

Type systems for concurrent programs guarantee such desirable properties...
research
12/13/2022

Data Layout from a Type-Theoretic Perspective

The specifics of data layout can be important for the efficiency of func...
research
01/09/2020

Monotone recursive types and recursive data representations in Cedille

Guided by Tarksi's fixpoint theorem in order theory, we show how to deri...
research
06/03/2020

Controlling the Size of Supercompiled Programs using Multi-result Supercompilation

Supercompilation is a powerful program transformation technique with num...

Please sign up or login with your details

Forgot password? Click here to reset