Idris (programming language)

About
Privacy
Disclaimer

Graph Chatbot

Related lectures (12)

Inductive Propositions: Reasoning and Evaluation Techniques

Discusses inductive propositions, their definitions, and applications in reasoning and evaluation techniques in Coq.

Propositions as Types: Logic and Programming Correspondence

Explores the relationship between logic proofs and programming evidence through the Curry-Howard Correspondence.

Big-step semantics: Defining arithmetic expressions and commands

Covers the definition of a simple programming language and its big-step semantics, including arithmetic expressions and imperative commands.

Logic Programming Techniques: Automated Proof Search and Unification

Covers logic programming concepts, focusing on automated proof search and unification techniques in Coq.

Hoare Logic: Foundations and Applications

Covers Hoare Logic, its foundations, applications, and significance in program verification.

Inductive Propositions: Understanding Evaluation in Coq

Covers inductive propositions in Coq, focusing on evaluation rules for arithmetic expressions and their applications in defining partial and non-deterministic functions.

Untitled

Polymorphism in Coq: Data Structures and Functions

Covers polymorphism in Coq, focusing on data structures and functions like lists, length, and append.

Polymorphism and Proofs

Covers parametric polymorphism, lists construction, tuples, generic methods, merge sort, and proving program properties.

Coq: Overview

Introduces Coq and focuses on proving the theorem and_comm step by step.

Types in Lambda Calculus

Covers types in lambda calculus, including defining types, specifying rules, and proving soundness.

Termination Analysis using Dependency Pairs

Explores automated termination analysis using dependency pairs, covering classical and modern techniques, annual competitions, and tools like AProVE.

Page 1 of 1