Skip to Main content Skip to Navigation
Habilitation à diriger des recherches

Lambda-calculus and formal language theory

Sylvain Salvati 1, 2
2 PoSET - Models for a Structured Programming of Space and Time
Inria Bordeaux - Sud-Ouest, SCRIME - Studio de Création et de Recherche en Informatique et Musique Électroacoustique, LaBRI - Laboratoire Bordelais de Recherche en Informatique
Abstract : Formal and symbolic approaches have offered computer science many application fields. The rich and fruitful connection between logic, automata and algebra is one such approach. It has been used to model natural languages as well as in program verification. In the mathematics of language it is able to model phenomena ranging from syntax to phonology while in verification it gives model checking algorithms to a wide family of programs. This thesis extends this approach to simply typed lambda-calculus by providing a natural extension of recognizability to programs that are representable by simply typed terms. This notion is then applied to both the mathematics of language and program verification. In the case of the mathematics of language, it is used to generalize parsing algorithms and to propose high-level methods to describe languages. Concerning program verification, it is used to describe methods for verifying the behavioral properties of higher-order programs. In both cases, the link that is drawn between finite state methods and denotational semantics provide the means to mix powerful tools coming from the two worlds.
Complete list of metadatas

Cited literature [285 references]  Display  Hide  Download
Contributor : Sylvain Salvati <>
Submitted on : Sunday, January 10, 2016 - 2:23:23 PM
Last modification on : Tuesday, May 29, 2018 - 9:14:04 AM
Document(s) archivé(s) le : Monday, April 11, 2016 - 10:54:33 AM



  • HAL Id : tel-01253426, version 1



Sylvain Salvati. Lambda-calculus and formal language theory. Computer Science [cs]. Université de Bordeaux, 2015. ⟨tel-01253426⟩



Record views


Files downloads