Types listes pour les langages conscient des ressources : une approche implicite
Abstract
A novel formalisation of variable control in languages with implicit names based on de Bruijn indices is presented.We design and implement three languages: first, a restricted language with implicit names; then, a restricted calculus with implicit names and explicit substitution, and finally, an extended calculus with implicit names, implicit substitution and resource control. We propose a novel concept of list types, which are used to give a simple and manageable definition of linearity. We develop an implementation in Haskell.
Fields of Study & Subjects
Logic
programming
and type systems
Teaching and Learning Programming
Syntax
Semantics
Linguistic Variation
Publication details
- Journal / source
- HAL (Le Centre pour la Communication Scientifique Directe)
- Publication date
- 12 January 2026
- Language
- EN
- Document type
- Preprint