Skip to main content
Graph
Search
fr
en
Login
Search
All
Categories
Concepts
Courses
Lectures
MOOCs
People
Practice
Publications
Startups
Units
Show all results for
Home
Lecture
Inductive Propositions: Understanding Evaluation in Coq
Graph Chatbot
Related lectures (28)
Inductive Propositions: Reasoning and Evaluation Techniques
Discusses inductive propositions, their definitions, and applications in reasoning and evaluation techniques in Coq.
Introduction to Coq: Arithmetic Expressions and Evaluators
Covers the basics of Coq, focusing on arithmetic expressions, evaluation, and proof techniques.
Coq Workshop: Introduction to Interactive Theorem Proving
Introduces Coq, an interactive theorem assistant based on the Curry-Howard isomorphism.
Hoare Logic: Foundations and Applications
Covers Hoare Logic, its foundations, applications, and significance in program verification.
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.
Data Abstraction: Modules and Specifications in Coq
Discusses data abstraction in programming, focusing on modules and specifications in Coq.
Coq: Overview
Introduces Coq and focuses on proving the theorem and_comm step by step.
Concept of Proof in Mathematics
Delves into the concept of proof in mathematics, emphasizing the importance of evidence and logical reasoning.
Polymorphism in Coq: Data Structures and Functions
Covers polymorphism in Coq, focusing on data structures and functions like lists, length, and append.
Logic Programming Techniques: Automated Proof Search and Unification
Covers logic programming concepts, focusing on automated proof search and unification techniques in Coq.
Coq Workshop: Inductive Data Types and Proofs
Covers the definition of an inductive data type in Coq and how to build proofs interactively using tactics.
Simply Typed Lambda Calculus: Foundations and Properties
Covers the simply typed lambda calculus, focusing on its syntax, semantics, and type system properties such as progress and preservation.
Verifying Programs with Stainless: How Stainless Works
Explores the inner workings of the Stainless framework, emphasizing verification-aware transformations and dependent type checking.
Untitled
Untitled
Proofs: Logic, Mathematics & Algorithms
Explores proof concepts, techniques, and applications in logic, mathematics, and algorithms.
The Languages of Isabelle: Isar, ML, and Scala
Explores the languages of Isabelle, focusing on Isar, ML, and Scala, covering proof schemes, Natural Deduction rules, inductive definitions, and the LCF approach.
Introduction to Proof Scripting: Basics of Ltac
Introduces the basics of proof scripting in Coq, focusing on the Ltac language and its tactics for managing proofs effectively.
Proofs and Logic: Introduction
Introduces logic, proofs, sets, functions, and algorithms in mathematics and computer science.
Coq: Introduction
Introduces Coq, covering defining propositions, proving theorems, and using tactics.
Previous
Page 1 of 2
Next