- Presentation
- HAL publications
- Activity reports
TYPICAL Research team
Types, Logic and computing
- Leader : Benjamin Werner
- Type : Project team
- Research center(s) : Saclay
- Field : Algorithmics, Programming, Software and Architecture
- Theme : Programs, Verification and Proofs
- Ecole Polytechnique, CNRS, Laboratoire d'informatique de l'école polytechnique (LIX) (UMR7161)
Team presentation
The Typical project-team aims to elaborate a language and environment for the development of formal proofs. This environment is dedicated to the development and certification of zero-default programs in safety-critical software.The project-team federates and coordinates the development of the proof-system Coq which allows the interactive specification and construction of formal proofs. The language of Coq is based on Type Theory: the functions can be represented by algorithms, predicates can be inductively defined by a set of clauses, proofs are considered as objects in the language.
The TypiCal project-team stems from the Coq project, which was joint with the Laboratoire de l'Informatique du Parallélisme (URA CNRS 1398) of the École Normale Supérieure de Lyon from January 1994 to September 1997. This was followed by the LogiCal project-team which was a common project with the Laboratoire de Recherche en Informatique (URA CNRS 410) from University Paris Sud until december 2007.
Research themes
- High-level concepts for proof languages: modules, subtyping, definitions by patterns, infinite structures.
- Internal representation of proof terms for an efficient implementation of reduction and proof construction.
- Development of mathematical proofs and mathematical libraries.
International and industrial relations
- The European working groupTypes.
- A strong participation to the INRIA MSR joint research centre.
Research teams of the same theme :
- ABSTRACTION - Abstract Interpretation and Static Analysis
- ATEAMS - Analysis and Transformation based on rEliAble tool coMpositionS
- CARTE - Theoretical adverse computations, and safety
- CASSIS - Combination of approaches to the security of infinite states systems
- CELTIQUE - Software certification with semantic analysis
- COMETE - Concurrency, Mobility and Transactions
- CONTRAINTES - Constraint programming
- DEDUCTEAM - Deduction modulo, interopérabilité et démonstration automatique
- FORMES - Formal Methods for Embedded Systems
- GALLIUM - Programming languages, types, compilation and proofs
- MARELLE - Mathematical, Reasoning and Software
- MEXICO - Modeling and Exploitation of Interaction and Concurrency
- MOSCOVA - Mobililty, security, concurrence, verification and analysis
- PAREO - Formal islands: foundations and applications
- PARSIFAL - Proof search and reasoning with logic specifications
- PI.R2 - Design, study and implementation of languages for proofs and programs
- PROSECCO - Programming securely with cryptography
- SECSI - Security of information systems
- TASC - Theory, Algorithms and Systems for Constraints
- TOCCATA - Certified Programs, Certified Tools, Certified Floating-Point Computations
- VERIDIS - Modeling and Verification of Distributed Algorithms and Systems
Contact
Team leader
Benjamin Werner
Tel.: +33 1 69 33 41 41
Secretariat
Tel.: +33 1 69 33 40 31
Find out more
Genealogy
This team follows
Inria
Inria.fr
Inria Channel

See also