Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Graph
Search

Cours

CS-452: Foundations of software

Résumé

The course introduces the foundations on which programs and programming languages are built. It introduces syntax, types and semantics as building blocks that together define the properties of a program part or a language. Students will learn how to apply these concepts in their reasoning.

Séances de cours

Enseignant·e·s (2)

Martin Odersky

Martin Odersky heads the programming research group at EPFL. His research interests cover fundamental as well as applied aspects of programming languages. They include semantics, type systems, programming language design, and compiler construction. The main focus if his work lies in the integration of object-oriented and functional programming. His research thesis is that the two paradigms are just two sides of the same coin and should be unified as much as possible. To prove this he has experimented a number of language designs, from Pizza to GJ to Functional Nets. He has also influenced the development of Java as a co-designer of Java generics and as the original author of the current javac reference compiler. His current work concentrates on the Scala programming language, which unifies FP and OOP, while staying completely interoperable with Java and .NET. Martin Odersky got his doctorate from ETHZ, in 1989. He held research positions at the IBM T.J. Watson Research Center from 1989 and at Yale University from 1991. He was then a professor at the University of Karlsruhe from 1993 and at the University of South Australia from 1997. He joined EPFL as full professor in 1999. He is associate editor of the Journal of Functional Programming and member of IFIP WG 2.8. He was conference chair for ICFP 2000, and program chair for ECOOP 2004 as well as ETAPS/CC 2007.

Thomas Emile Bourgeat

Source officielle

Page Moodle

http://go.epfl.ch/CS-452

Résumé

Séances de cours

Enseignant·e·s (2)

Martin Odersky

Thomas Emile Bourgeat

Source officielle

Page Moodle

http://go.epfl.ch/CS-452

Proximité ontologique

Informatique théorique

Théorie des langages de programmation: Langage de programmation de haut niveau, Théorie des types

Logique

Logique classique: Calcul des prédicats

Séances de ce cours (23)

Séance papier et stylo: Lambda Calculus Proofs Connectez-vous à Mediaspace pour regarder cette vidéo

Plonge dans Lambda Calculus preuves, mettant l'accent sur l'induction structurelle et la manipulation variable.

Atelier Coq: Types de données inductives et preuves

Couvre la définition d'un type de données inductives dans Coq et la façon de construire des preuves de manière interactive en utilisant des tactiques.

Lambda Calculus: Numéros d'église

Explore les chiffres de l'église, les booléens, les paires, la récursion et l'équivalence comportementale dans Lambda Calculus.

Types dans Lambda Calculus

Couvre les types dans le calcul lambda, y compris la définition des types, la spécification des règles et la preuve de la solidité.

Type Systems: Règles de conservation et de dactylographie

Couvre la préservation, la substitution, l'affaiblissement et le séquençage dans les systèmes de type.

Afficher plus

Cours associés (30)

CS-214: Software construction

Learn how to design and implement reliable, maintainable, and efficient software using a mix of programming skills (declarative style, higher-order functions, inductive types, parallelism) and fundamental software construction concepts (reusability, abstr ...

CS-320: Computer language processing

We teach the fundamental aspects of analyzing and interpreting computer languages, including the techniques to build compilers. You will build a working compiler from an elegant functional language into machine code using a popular backend called LLVM (htt ...

CS-101: Advanced information, computation, communication I

Discrete mathematics is a discipline with applications to almost all areas of study. It provides a set of indispensable tools to computer science in particular. This course reviews (familiar) topics as diverse as mathematical reasoning, combinatorics, disc ...

CS-550: Formal verification

We introduce formal verification as an approach for developing highly reliable systems. Formal verification finds proofs that computer systems work under all relevant scenarios. We will learn how to use formal verification tools and explain the theory and ...

ME-213: Programmation pour ingénieur

Mettre en pratique les bases de la programmation vues au semestre précédent. Développer un logiciel structuré. Méthode de debug d'un logiciel. Introduction à la programmation scientifique. Introduction à l'instrumentation virtuelle. ...

Afficher plus