Posts par tags

Algebre

Chambert-Loir

L3

TD

algèbre

algèbres

anneaux

corps

cours

cours1

cours2

cours3

cours4

cours5

ensembles

groupe-symétrique

groupes

groupes-abéliens

magmas

maths

monoïdes

morphismes

quotients

relations

représentation

Algorithmique

Algorithmique

DM

DM1

Habib

Haddad

Hoare

Karatsuba

Kruskal

L3

Michel Habib

Prim

Serge Haddad

TD

TD1

TD2

TD3

TD4

TD5

TD8

TD9

algo

algorithmes-dapproximation

algorithmique

algèbre

anneaux

approximation

arbres

binomial

calcul-formel

complexité

complexité-amortie

complexité-en-moyenne

compression

compression-données

correction

cours

cours1

cours2

cours4

cours5

cours6

cours8

cours9

dictionnaires

diviser-pour-régner

division-euclidienne

entropie

fibonacci

files

files-de-priorité

glouton

graphe

idéaux

info

master-theorem

pgcd

polynomes

polynomes-multivariables

potentiel

probabilités

probas

programmation-dynamique

rendu-monnaie

sac-à-dos

spécification

tas

terminaison

théorie-de-linformation

tri-rapide

Anglais

Windish

ZFC

anglais

cardinals

cubism

english

essay

infinity

lambda-calculus

lettres

neural

neural-networks

skit

slides

speech

talk

vote

Architecture-systeme

Bruijn

Debian

Hulin-Hubard

Jessie

L3

Linux

OS

Peterson

RIM

SMTP

Schwoon

TD

TD3

TD4

TD5

TD6

TP

TP1

additionneur

architecture

architecture-et-système

architecture-système

bascule-D

bash

bit-à-bit

chaînes-de-caractères

chmod

chown

codeurs

codeurs-de-priorité

commandes

concurrente

construction

cours

cours1

cours3

cours4

cours5

cours6

cours7

cours8

cours9

entiers

fichiers

flottants

fonctionnement

fonctions-arithmétiques

graphes

histoire

info

intel

ligne-de-commandes

linux

mails

multiplexeur

multiplicateur

n-codeurs

opérations-binaires

ordinateurs

portes-logiques

processeurs

processus

projet

proxy

réseau

réseaux

shell

signaux

ssh

systeme

système-dexploitation

sémaphore

séquence

terminal

threads

transistors

unix

utilisateurs

x86

Biochemical-programming

Fages

Krivine

M2

MPRI

TP1

TP4

TP7

category-theory

exercises

genetic-algorithm

kappa

project

signalling-pathways

systems-biology

Calculabilite

Ackermann

CTL

Comon

DM

DM1

Grzegorczyk

Gödel

Koutsos

L3

Markov

Minsky

Picaronny

Post

Rice

Russell

SPACE-Hierarchy-Theorem

Schnoebelen

TD

TD1

TD2

TD3

TD4

TD6

TD7

TD8

accélération-linéaire

argument-diagonal

arithmétique

axiomes

calculabilité

castors

chaînes-de-Markov

complexité

cours

cours1

cours2

cours3

cours4

cours5

cours6

cours7

cours8

fonctions-calculables

histoire

indécidabilité

info

introduction

machine-universelle

machines-IO

machines-alternantes

machines-de-turing

maths

pavages

plusieurs-rubans

probabilités

probas

problème-de-correspondance-de-post

problème-de-larrêt

problèmes-indécidables

quine

récursif

récursivement-énumérable

récursives

récursives-partielles

récursives-primitives

réduction

réductions

virus

Categories-lambda-calculi

Melliès

Mimran

Yoneda

algebras

bayesian

categories

course

exercises1

exercises2

exercises3

exercises4

exercises5

graph-category

graphs

introduction

lambda-calculus

lecture1

lecture2

lecture3

lecture4

lecture5

lecture6

monad

monads

presentation

presheaf

probability

Categories-work

HoTT

M2

Lecture 1: Basics

[\newcommand\yoneda{ {\bf y}} \newcommand\oppositeName{ {\rm op}} \newcommand\opposite[1]{ {#1}^\oppositeName} \newcommand\id[1][{}]{ {\rm id}{#1}} \newcomma...

category-theory

Lecture 1: Basics

[\newcommand\yoneda{ {\bf y}} \newcommand\oppositeName{ {\rm op}} \newcommand\opposite[1]{ {#1}^\oppositeName} \newcommand\id[1][{}]{ {\rm id}{#1}} \newcomma...

cours

Lecture 1: Basics

[\newcommand\yoneda{ {\bf y}} \newcommand\oppositeName{ {\rm op}} \newcommand\opposite[1]{ {#1}^\oppositeName} \newcommand\id[1][{}]{ {\rm id}{#1}} \newcomma...

lecture

Lecture 1: Basics

[\newcommand\yoneda{ {\bf y}} \newcommand\oppositeName{ {\rm op}} \newcommand\opposite[1]{ {#1}^\oppositeName} \newcommand\id[1][{}]{ {\rm id}{#1}} \newcomma...

reading-group

sydney

working-group

Lecture 1: Basics

[\newcommand\yoneda{ {\bf y}} \newcommand\oppositeName{ {\rm op}} \newcommand\opposite[1]{ {#1}^\oppositeName} \newcommand\id[1][{}]{ {\rm id}{#1}} \newcomma...

Club-algo

Complexity

AM

BPP

Courcelle

DM

Goubault-Larrecq

Jacomme

MSO

NP

Poulain

Schmitz

Schnoebelen

advanced-complexity

assignment

complexity

course

exercices

exercices1

exercices2

exercices3

exercices4

exercices5

graph

homework

introduction

lecture

lecture1

lecture2

tree-automata

Computational-geometric-learning

Glisse

Maria

topological-data-analysis

Computational-neuroscience

Bayes

DM

Dumont

Gibbs

Hopfield

LDA

LIF

TD-learning

assignment

computational-neuroscience

correlation

covariance

exercise

homework

integrate-and-fire

lecture

neural-networks

neuroscience

perceptron

reinforcement-learning

signal-detection

softmax-Gibbs

temporal-difference-learning

Computer-vision

Aubry

CNN

Isomap

LLE

MDS

PCA

Sammon

TP

TP1

TP2

TP3

TP4

articles

calibration

cameras

computer-vision

course

dimensionality-reduction

exercises

force-directed-graph-drawing

introduction

lecture

lecture1

lecture2

lecture3

machine-learning

meta-SNE

neural-networks

practical-session

practical-session1

projective-geometry

representations

summary

tSNE

Concurrency

Emmanuel-Haucourt

Pospaces, Local pospaces

Recap: every program in our setting is comprised of sequential processes $(P_1, …, P_n)$ that are turned into a control flow graph $(G_1, …, G_n)$

Haucourt

category-theory

Pospaces, Local pospaces

Recap: every program in our setting is comprised of sequential processes $(P_1, …, P_n)$ that are turned into a control flow graph $(G_1, …, G_n)$

concurrency

Pospaces, Local pospaces

Recap: every program in our setting is comprised of sequential processes $(P_1, …, P_n)$ that are turned into a control flow graph $(G_1, …, G_n)$

directed-algebraic-topology

Pospaces, Local pospaces

Recap: every program in our setting is comprised of sequential processes $(P_1, …, P_n)$ that are turned into a control flow graph $(G_1, …, G_n)$

Conferences

Comon

Cortier

Finkel

L3

M2

Péris-Delacroix

Rapports

Varsovie

conference

conférence

cours

game-theory

info

rapport

stages

talk

tutorat

vote

vote-électronique

Domains-categories-games

Curien

Ehrhard

M2

MPRI

Melliès

category-theory

cours

domains

games

lecture

Exercices

Chambert-Loir

L3

TD

algèbre

anneaux

maths

Foundations-proof-systems

Blot

Dowek

M2

MPRI

cours

deduction-modulo

lecture

proof-assistants

proof-systems

Functional-programming

Bobot

Krivine

M2

MPRI

Madiot

Pottier

Remy

Why3

automatic-differentiation

category-theory

computational-analysis

cours

functional-programming

lambda-calculus

lecture

machine-learning

project

proof-of-programs

verification

why3

Game-theory-CS

Berwanger

M2

MPRI

Zielonka

cours

game-theory

lecture

HoTT

EET

HIT

Herbelin

HoTT

J-eliminator

Tabareau

UIP

co-inductive

co-inductive-types

cours

course

higher-inductive-types

homotopy-type-theory

inductive

inductive-types

lecture

theorie-des-types

theorie-homotopique-des-types

Homological-algebra

Hennion

M2

Orsay

abelian-categories

category-theory

cours

homologie

homology

lecture

Lambda-calcul

Ackermann

Bury

DM

Girard

Goubault

HA2

L3

Scott

Système-F

TD

TD1

TD10

TD11

TD3

TD4

TD7

TD8

TD9

cours

cours1

cours2

cours3

cours4

dcpos

déduction-modulo

lambda-calcul

lambda-calcul-simplement-typé

logique

modèle

modèles

réécriture

topologie

types

types-de-données

Langages-formels

AAPD

AFP

Antimirov

Arden

Boustrophédon

DM

DPDA

Dickson

Dyck

Fortin

Glushkov

Haar

MSO

Moore

Moore-machines

Ogden

PDA

Post

Schmitz

Schwoon

TD

TD1

TD10

TD11

TD13

TD14

TD15

TD2

TD3

TD4

TD5

TD6

TD8

TD9

TP

accessibilité

ambiguïté

analyse-lexicale

analyse-syntaxique

analyse-syntaxique-ascendante

automate-minimal

automates

automates-a-pile

automates-a-piles

automates-darbres

automates-double-sens

automates-pondérés

caculabilité

compilateur

computability

context-free-languages

correspondance-de-Post

cours

cours1

cours2

cours3

cours4

cours6

cours7

cours8

fonctions-séquentielles

formal-languages

grammaires

introduction

langages-algébriques

langages-apériodiques

langages-formels

lecture-ascendante

lecture-descendante

logique

logique-monadique

logique-mots

logique-temporelle-linéaire

minimisation

morphismes

non-deterministic-languages

prefix-free

push-down

pushdown-automata

reconnaissabilité

undecidability

Linear-logic

Accatoli

Lecture 11:

Important concepts in rewriting theory: when redexes are created

Kesner

M2

Lecture 11:

Important concepts in rewriting theory: when redexes are created

MPRI

Lecture 11:

Important concepts in rewriting theory: when redexes are created

Miller

Pagani

abstract-machines

Lecture 11:

Important concepts in rewriting theory: when redexes are created

complexity

Lecture 11:

Important concepts in rewriting theory: when redexes are created

computational-logic

cours

Lecture 11:

Important concepts in rewriting theory: when redexes are created

lecture

Lecture 11:

Important concepts in rewriting theory: when redexes are created

linear-logic

Lecture 11:

Important concepts in rewriting theory: when redexes are created

Logique

Bernays-Schönfinkel

Comon

Cython

DM

Dubut

Gödel

Herbrand

Hirschi

Kripke

L3

Lick

Lozes

OCamL

PSPACE

PSPACE-complet

Peano

Picross

Project

Python

QBF

SAT

Sudoku

TD

TD1

TD10

TD11

TD12

TD2

TD3

TD4

TD5

TD6

TD7

TD8

TD9

Thiré

argument-diagonal

cohérence

compacité

complexité

complétude

complétude-réfutationnelle

cours

cours1

cours2

cours3

cours5

cours6

cours7

cours8

cours9

déduction-naturelle

factorisation

forme-clausale

incomplétude

introduction

logic

logique

logique-classique

logique-du-premier-ordre

logique-intuitionniste

modèles-non-satndards

modèles-non-standards

problème-de-larret

résolution

résoluution

stratégie-de-résolution

séquents

théories

théories-axiomatiques

théories-indécidables

unification

élimination-quantificateurs

ML-neuroscience

AI

Bayes

Deneve

Denève

Ehresmann

Kushnir

Leptourgos

ML

ML-neuroscience

Maras

applied-categories

balanced-networks

biology

category-theory

cours

emergence

exercise

exercises

graphical-models

inference

lab

machine-learning

networks

neuro-robotique

neuroscience

practical-session

problem-set

project

reinforcement-learning

spiking-networks

tutorial

Maths-discretes

Burnside

Catalan

DM

DM1

DM2

DM3

Dickson

Dilworth

Dubut

Erdös

Euler

Frobenius

Hasse

Koenig

L3

Lick

Markov

MathPark

Nerode

Picaronny

Poincaré

Ramsey

TD

TD1

TD10

TD2

TD3

TD4

TD5

TD8

TD9

actions

algèbre

anneaux

anniversaires

antichaînes

arbres-aléatoires

automate-minimal

automates

bel-ordre

bon-ordre

cardinalité

catégories

chaînes

chaînes-de-Markov

cours

cours1

cours2

cours3

cours4

cours5

cours6

cours7

cours8

cours9

crible

cycles

dénombrabilité

dénombrable

ensembles

fiche

groupe-libre

groupe-symétrique

groupes

idempotence

indicatrice-dEuler

langages-algébriques

lois

machines-de-Minsky

maths

maths-discrètes

monoïde-libre

monoïdes

nombres-de-Catalan

orbites

ordre-total

partitions

permutations

probabilités

probas

problème-des-anniversaires

relations

relations-dequivalence

relations-dordre

relations-déquivalence

résumé

statistiques

structures-algébriques

séries-génératrices

transpositions

trellis

équations-de-mots

équipotence

Modules-groupes

Cadoret

Sylow

algèbre

course

exercices

groupe-alterné

groupes

introduction

lecture1

lecture2

modules

permutations

Neuro-robotique

Chetouani

Coninx

Filliat

Gaussier

Girard

Guigon

Khamassi

Perrin

ROS

classification

cours

exercise

intent-recognition

intention

kNN

lab

lecture

motor-control

naigation-strategies

neuro-robotique

neurorobotics

neuroscience

perrin

project

regression

reinforcement-learning

robotics

robotique

supervised-learning

tutorial

Neuroanatomie

Finkel

Hasboun

L3

Legay

cogmaster

cognition

neurosciences

Neuromodeling

Beiran

FORCE-learning

Hodgkin-Huxley

Hopfield

Hopfield-network

LIF

Poisson

Rescola-Wagner

Sussilo

TD-learning

autapse

chaos

chaotic-neural-networks

circuit

course

decision-making

delta-rule

drift-diffusion

dynamical-system

exercises

inhibition

integrate-and-fire

introduction

lab

lecture

modeling

modelling

mutual-inhibition

networks

neural-modeling

neural-modelling

neuromodeling

neuron-with-autapse

neuroscience

practical-session

project

recurrent-neural-networks

reinforcement-learning

softmax-Gibbs

spike-trains

supervised-learning

tutorial

Prepa

Avogadro

Ax

Brown

Brownien

Cauchy

ENS

Einstein

Grothendieck

Loi-hypergéométrique

McCarthy

Prépa

Smoluchowski

Stokes

TIPE

Zariski

algèbre-commutative

algèbre-linéaire

analyse

analyse-réelle

dérivabilité

exercice

intégrale

logique

logique-mathématique

maths

mouvement-brownien

oral

orbites

physique

probabilités

probas

système-différentiel

série-de-fonctions

théorie-des-Modèles

uniforme-continuité

valeurs-propres

Preuve-assistee-par-ordinateur

Coq

DM

HOL

HOL

Symmetry in HOL

Heyting

Isabelle

Isabelle

Isabelle (named by Lawrence Paulson after the daughter of Gérard Huet, as a tribute): a popular generic theorem prover

Letouzey

HOL

Symmetry in HOL

Isabelle

Isabelle (named by Lawrence Paulson after the daughter of Gérard Huet, as a tribute): a popular generic theorem prover

TP

arithmetic

assignment

cours

HOL

Symmetry in HOL

Isabelle

Isabelle (named by Lawrence Paulson after the daughter of Gérard Huet, as a tribute): a popular generic theorem prover

course

HOL

Symmetry in HOL

Isabelle

Isabelle (named by Lawrence Paulson after the daughter of Gérard Huet, as a tribute): a popular generic theorem prover

dependent-types

introduction

HOL

Symmetry in HOL

Isabelle

Isabelle (named by Lawrence Paulson after the daughter of Gérard Huet, as a tribute): a popular generic theorem prover

logic

preuves-programmes

HOL

Symmetry in HOL

Isabelle

Isabelle (named by Lawrence Paulson after the daughter of Gérard Huet, as a tribute): a popular generic theorem prover

project

proof-assistant

Preuves-programmes

Mazza

Mazzas

PCoh

Pagani

TD

coherence-spaces

cours

course

exercises

introduction

lab

preuves-programmes

probabilistic-coherence-spaces

tutorial

Programmation

C

DCPO

DM

DM1

Goubault-Larrecq

Goubault_Larrecq

Halfon

Knaster-Tarski

L3

Lozes

MIPS

OCamL

Projet

Scott

TD

TD1

TD12

TD2

TD4

TD5

TD6

Thiré

adéquation

arithmétique-des-pointeurs

assembleur

caractères

classe-de-stockage

compilateur

compilation

console

copies

cours

cours1

cours2

cours3

cours4

cours6

cours7

crans

encodage

entiers

exceptions

flottants

flux-dinformation

foncteurs

goubault

info

introduction

laison-dynamique

langages-de-programmation

modes-dappel

modules

pointeurs

portée

portée-lexicale

processeur

programmation

programmation2

seminaire

structures-de-données

sémantique

terminal

topologie

treillis

typage

type

x86

Proof-assistants

Barras

M2

MPRI

coq

cours

lecture

proof-assistants

Research

Abiteboul

Chatain

Schnoebelen

article

course

introduction

introduction-to-research

lecture1

lecture2

lecture3

research

Robot-motion-planning

Hopcroft

Laumond

Mansard

Wilfong

algebraic-topology

course

final

lecture1

lecture2

lecture3

motion-planning

report

robot

robot-motion-planning

Statistical-learning

Bach

Gaillard

Lecture 2: Regression

Linear Regression and Logistic regression: particular cases of empirical risk regression

Genevay

Hoeffding

K-means

LASSO

LDA

Newton

PAC-Learning

PCA

QDA

TD

TD12

TD3

TD5

TD6

TP

TP1

TP10

TP11

TP2

TP4

TP6b

barrier

convex

convex-optimization

course

Lecture 2: Regression

Linear Regression and Logistic regression: particular cases of empirical risk regression

exercises

introduction

Lecture 2: Regression

Linear Regression and Logistic regression: particular cases of empirical risk regression

learning

lecture

lecture1

lecture2

Lecture 2: Regression

Linear Regression and Logistic regression: particular cases of empirical risk regression

lecture3

lecture4

lecture5

linear

logistic

maximum-likelihood

online-learning

practice-session

regression

Lecture 2: Regression

Linear Regression and Logistic regression: particular cases of empirical risk regression

regression-linéaire

regression-logistique

reinforcement-learning

statistical-learning

Lecture 2: Regression

Linear Regression and Logistic regression: particular cases of empirical risk regression

unsupervised-learning

Theorie-modeles

Ibarlucia

Espace des types

Proposition: On se fixe $ℳ, \; A ⊆ M, \; \overline{x}, \; p = p(\overline{x})$ un ensemble de $ℒ_A$-formules. Si $𝒩 \succcurlyeq ℳ$, alors ...

Servi

cours

Espace des types

Proposition: On se fixe $ℳ, \; A ⊆ M, \; \overline{x}, \; p = p(\overline{x})$ un ensemble de $ℒ_A$-formules. Si $𝒩 \succcurlyeq ℳ$, alors ...

course

Espace des types

Proposition: On se fixe $ℳ, \; A ⊆ M, \; \overline{x}, \; p = p(\overline{x})$ un ensemble de $ℒ_A$-formules. Si $𝒩 \succcurlyeq ℳ$, alors ...

introduction

Espace des types

Proposition: On se fixe $ℳ, \; A ⊆ M, \; \overline{x}, \; p = p(\overline{x})$ un ensemble de $ℒ_A$-formules. Si $𝒩 \succcurlyeq ℳ$, alors ...

model-theory

Espace des types

Proposition: On se fixe $ℳ, \; A ⊆ M, \; \overline{x}, \; p = p(\overline{x})$ un ensemble de $ℒ_A$-formules. Si $𝒩 \succcurlyeq ℳ$, alors ...

theorie-des-modeles

Espace des types

Proposition: On se fixe $ℳ, \; A ⊆ M, \; \overline{x}, \; p = p(\overline{x})$ un ensemble de $ℒ_A$-formules. Si $𝒩 \succcurlyeq ℳ$, alors ...

Topologie-algebrique

Itenberg

cours

course

introduction

topologie-algebrique

Tree-automata

Jacomme

Schmitz

TD1

TD2

TD3

TD4

course

course1

course2

course3

course4

introduction

regularity

tree-automata

fields

posts

ARPE

Agda

Brunerie

Brunerie-type-theory

Cambridge

Cambridge-University

Capriotti

Comon

DM

ENS

Fiore

Garner

Glynn-Winskel

HOTT

Kammar

Kan-extensions

Kleisli-category

LL

M2

MPRI

Macquarie

Macquarie-University

Marcelo-Fiore

Nottingham

Ohad-Kammar

Oxford

Richard-Garner

Ross-Street

Sam-Staton

Sydney

Winskel

categories

categories-with-families

category-theory

compact-closed

complétude-réfutationnelle

concurrency

crans

distributors

développement

développement-web

effect-algebras

effect-modules

effectus-theory

enriched-categories

ens-cachan

ens-paris-saclay

event-structures

evil

fibrations

globular-sets

higher-categories

homotopy-type-theory

ideal-distributors

ideals

inductive-constructor

infinity-categories

intelligence-artificielle

internship

lattice-theory

lattices

linear-logic

logique

logique-de-description

nPOV

omega-groupoids

orthogonal-construction

presheaves

product-type

profunctors

quantum

quantum-computation

quantum-logic

recursor

report

résolution

sections

site-web

sites

star-autonomous

stict-omega-groupoids

tricocycloids

tutoriels

type-theory

weak-omega-groupoids

web

zamok