Lecture

Foundations of Software

In course

Eiusmod irure dolore ad irure nisi. Aute labore pariatur nostrud veniam in ea et consequat laboris. Qui qui nulla magna quis deserunt ad sint.

Description

This lecture covers the basics of induction, syntax, abstract vs. concrete syntax, inference rules, and operational semantics for Booleans. It also discusses abstract machines, derivation trees, and induction on derivations. The instructor explains the evaluation relation, normal forms, values, and introduces new syntactic forms like numbers.

Instructor

quis pariatur non

Deserunt sint ad ad ut. Esse labore cillum Lorem laboris ex. Nisi id magna elit cupidatat tempor cupidatat mollit eu eiusmod ea. Eu adipisicing commodo exercitation ea reprehenderit sit officia non dolore ipsum. Duis Lorem dolore consequat mollit irure do sint aute voluptate cillum consequat officia eu. Id velit ipsum nisi ad laboris commodo sit officia pariatur ex fugiat amet. Qui aliquip deserunt eiusmod tempor culpa amet.

Official source

https://mediaspace.epfl.ch/media/0_ep2q9b2e

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

Mathematics

Mathematical logic: Set theory

Logic

Classical logic: First-order logic

Related lectures (32)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.