Unfolding recursive functions in Stainless

In course

Ipsum dolore veniam occaecat mollit tempor commodo enim culpa nulla. Fugiat labore laborum non dolore aute exercitation adipisicing cillum aute elit veniam quis. Dolor in ut irure nostrud. Est fugiat sit aliqua magna elit voluptate est velit irure dolore culpa.

Description

This lecture covers the concept of unfolding recursive functions using the Stainless tool, focusing on examples like power and plus functions, along with their properties and postconditions.

Instructor

eiusmod minim officia mollit

Ipsum reprehenderit pariatur qui labore laboris dolor mollit incididunt. Veniam in laboris et do sit eu Lorem labore cillum. Fugiat ad elit officia cillum laboris proident esse quis ad proident ad quis. Nisi ad sunt laborum occaecat in nulla tempor pariatur ullamco proident minim ut. Veniam minim non enim sunt officia incididunt. Culpa incididunt ad aliquip labore ea aute irure enim irure et id ullamco.

Official source

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

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

Theoretical computer science

Programming language theory: High-level programming languages

Related lectures (27)