Coq Workshop: Inductive Data Types and Proofs

In course

Consectetur ullamco officia dolore deserunt deserunt amet pariatur irure nostrud laborum adipisicing sit dolore. Consequat culpa velit labore fugiat fugiat cupidatat nostrud nisi laborum aliqua. Quis nostrud consequat sunt qui magna esse ea enim fugiat. Et quis elit voluptate nulla sunt nostrud amet sint nisi esse voluptate nulla. Laboris Lorem laborum mollit est sit dolor et non anim ea. Tempor voluptate duis dolore ad excepteur. Reprehenderit enim eu occaecat fugiat excepteur.

Description

This lecture introduces the Coq proof assistant and covers the definition of an inductive data type in Coq, specifically focusing on the NB language. The lecture explains how to define terms in Coq, create values corresponding to the terms in the NB language, and define multi-step evaluation relations. It also delves into the concept of values in the NB language and how to build proofs interactively using tactics in Coq.

Instructor

aliquip qui excepteur nulla

In minim commodo laboris Lorem duis aliqua labore. Sit ex magna aute ut dolore dolore quis consectetur ex sit deserunt cupidatat. Nulla qui proident enim proident incididunt ut occaecat labore proident occaecat irure id.

Official source

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

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

Computer engineering

Computer architecture: Topics in computer architecture

Computer data storage: File systems

Theoretical computer science

Programming language theory: High-level programming languages, Type theory

Logic

Classical logic: First-order logic

Related lectures (73)