InfoSansOrdi / pedago-rennesLinks
Matériel utilisé dans les cours Pédago1 et Pédago2 de l'ENS Rennes
☆19Updated 2 weeks ago
Alternatives and similar repositories for pedago-rennes
Users that are interested in pedago-rennes are comparing it to the libraries listed below
Sorting:
- Page du cours preuves assistées par ordinateur 2021☆17Updated 7 months ago
- A generic goal preprocessing tool for proof automation tactics in Coq☆15Updated 3 months ago
- A library implementing a simplex algorithm, in a functional style, for solving systems of linear inequalities☆16Updated last year
- Correctness proof of the Huffman coding algorithm in Coq [maintainer=@palmskog]☆14Updated last month
- Another attempt for visualizing proofs☆12Updated last year
- Formal Semantics for Why3☆19Updated 2 months ago
- Print with style in your terminal using Format's semantic tags☆19Updated 2 years ago
- LP and MIP modeling in OCaml☆29Updated 5 months ago
- Formalisation of a capability machine and principles for reasoning about security properties☆22Updated 5 months ago
- HoCL (Higher Order dataflow Coordination Language) is a language for describing dataflow networks and generating tool-specific descriptio…☆22Updated 4 years ago
- A simple BDD library for OCaml☆13Updated 7 months ago
- An OCaml library for creating pandoc filters.☆32Updated last year
- OCaml syntax extension for synchronous programming...☆32Updated 2 years ago
- Cours d'informatique en MP2I (OCaml, C, SQL)☆46Updated 4 months ago
- Sokoban (in Coq) [maintainer=@erikmd]☆24Updated 11 months ago
- Kleene algebra modulo theories☆27Updated 3 years ago
- Identifying similar OCaml codes☆30Updated last year
- An HTML documentation generator for Coq source files☆31Updated last year
- Formalising session types in Coq☆17Updated 6 years ago
- A not-quite-so-simple Binary Decision Diagrams implementation for OCaml☆37Updated 3 years ago
- Constraint solver based on abstract domains☆33Updated last year
- Faithful reimplementation of Minisat 2.2 in OCaml.☆39Updated 2 years ago
- Some programs from Rustan Leino's "Program Proofs", in Why3.☆16Updated 2 years ago
- A verified Implementation of a mini prolog☆17Updated 3 years ago
- Ressources pour la classe de MPI* à Louis-le-Grand☆27Updated this week
- A parsing library that compiles grammars to combinators using elimination of left recursion☆22Updated this week
- Regular languages in types☆21Updated 8 years ago
- A Deductive Verification Tool for OCaml Programs☆75Updated 2 months ago
- Automatically generates Coq FFI bindings to OCaml libraries [maintainer=@lthms]☆38Updated 2 years ago
- coinduction library for Coq☆21Updated last month