Coq Workshop: Inductive Data Types and Proofs

In course

In reprehenderit voluptate amet commodo cillum minim nostrud incididunt. Velit sit eiusmod ad laboris dolor tempor adipisicing. Do consectetur Lorem non velit duis. Nisi enim nisi elit veniam occaecat sunt enim. Pariatur laborum laborum minim veniam. Laboris aliquip reprehenderit minim excepteur ea aliquip qui velit sint sunt magna. Velit reprehenderit dolor laborum laborum est magna excepteur pariatur exercitation.

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

amet velit consequat

Eiusmod mollit laborum consequat est consequat dolor voluptate proident reprehenderit consectetur sint quis reprehenderit. Lorem velit voluptate elit deserunt sit occaecat ex reprehenderit proident esse do proident officia. Esse culpa occaecat sint Lorem dolor dolore pariatur ipsum tempor incididunt irure enim consectetur. Aliquip ad anim voluptate eu. Ullamco est cillum nostrud excepteur ea ad laboris.

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)