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
Polymorphism in Coq: Data Structures and Functions
Graph Chatbot
Related lectures (28)
Previous
Page 1 of 3
Next
Data Abstraction: Modules and Specifications in Coq
Discusses data abstraction in programming, focusing on modules and specifications in Coq.
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.
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.
Coq Workshop: Introduction to Interactive Theorem Proving
Introduces Coq, an interactive theorem assistant based on the Curry-Howard isomorphism.
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.
Introduction to Coq: Arithmetic Expressions and Evaluators
Covers the basics of Coq, focusing on arithmetic expressions, evaluation, and proof techniques.
Hoare Logic: Foundations and Applications
Covers Hoare Logic, its foundations, applications, and significance in program verification.
Inductive Propositions: Reasoning and Evaluation Techniques
Discusses inductive propositions, their definitions, and applications in reasoning and evaluation techniques in Coq.
Polymorphism and Proofs
Covers parametric polymorphism, lists construction, tuples, generic methods, merge sort, and proving program properties.
Foundations of Scala: Modelling and Type Systems
Covers the foundations of Scala, including modelling recursive types, parameterized types, and variance.
