Lecture
Foundations of Software: Modeling Programming Languages
In course
DEMO: fugiat laborum
Proident minim quis incididunt sunt mollit sit adipisicing pariatur elit excepteur. Amet id tempor non do adipisicing sint fugiat officia nulla aute officia eiusmod. Ullamco nulla fugiat ad esse qui veniam consectetur irure do cupidatat magna commodo. Ipsum Lorem do officia proident do deserunt Lorem consectetur nisi amet. Elit elit ad aliquip nisi in ut consequat consequat excepteur eiusmod. Dolore laborum amet ipsum dolor et.
Description
This lecture introduces the Foundations of Software course, focusing on the mathematical study of program behaviors. Topics include parsing, domain-specific languages, parser combinators, and the basic idea of defining functions for language recognition. The course emphasizes operational techniques and type systems, providing a deep understanding of core language features and powerful tools for language design.
Instructor
do reprehenderit consectetur quis
Id aliqua ad mollit aliquip elit duis laboris excepteur dolore consequat cillum quis. Voluptate est do fugiat nulla in aliqua sit dolor commodo Lorem elit. Mollit non adipisicing qui sit non. Ad eiusmod ea dolor est ut. Nostrud Lorem dolor magna sunt do esse. Exercitation esse amet voluptate occaecat dolore cillum ex id quis aute anim.
Official source
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
Ontological neighbourhood
Related lectures (48)
Taming Null References
Explores the challenges of null references in programming languages and proposes solutions to mitigate their drawbacks while ensuring compatibility with existing codebases.
Solving Type Constraints
Explains the process of solving type constraints using the unification algorithm and generalization for flexible type inference.
Stainless Verification System Tutorial
Introduces Stainless, an open-source tool for verifying Scala programs, covering language, modeling, verification tips, and inner workings.
Language Theory into Practice
Explores the practical application of language theory, including quicksort, gradual typing, and efficient memory management, as well as the challenges of reduction program synthesis.
Records and Variants
Introduces records, variants, evaluation rules, typing rules, aliasing challenges, and benefits in programming languages.