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
Category
Type theory
Formal sciences
Theoretical computer science
Programming language theory
Type theory
Graph Chatbot
Related lectures (32)
Lambda Calculus and Type Safety: An Overview
Provides an overview of lambda calculus, type safety, and type inference in programming languages.
Dependent Types in Programming Languages
Explores maps, type operators, equivalence, first-class types, System Fw, Coq, and the challenges of type checking in programming languages.
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.
Logical Formulas and Types: Understanding the Kerry Howard Isomorphism
Explores the Kerry Howard Isomorphism, translating logical propositions into types and terms, with a focus on proof by induction and exam preparation.
Type Checking and Reconstruction: Equations and Unification
Delves into type checking, reconstruction, equations, unification, Hindley/Milner system, polymorphism, and principal types.
Lambda Calculus: Syntax and Abstractions
Introduces terms, abstractions, applications, and values in the lambda calculus.
Types in Lambda Calculus
Covers types in lambda calculus, including defining types, specifying rules, and proving soundness.
Coq Workshop: Introduction to Interactive Theorem Proving
Introduces Coq, an interactive theorem assistant based on the Curry-Howard isomorphism.
Verifying Programs with Stainless: How Stainless Works
Explores the inner workings of the Stainless framework, emphasizing verification-aware transformations and dependent type checking.
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.
Church Numerals and Conditionals
Explores Church numerals and encoding conditionals in lambda calculus.
Lambda Calculus: Church Numerals
Explores Church numerals, Booleans, pairs, recursion, and behavioral equivalence in Lambda Calculus.
Introduction to Coq: Arithmetic Expressions and Evaluators
Covers the basics of Coq, focusing on arithmetic expressions, evaluation, and proof techniques.
Verified Functional Programming: Nicolas Voirol public PhD thesis defense
Explores verified functional programming, formal verification, SMT solvers, type checking, Scala features, automation, and dependent types.
Pen-and-paper session: Lambda Calculus Proofs
Delves into Lambda Calculus proofs, emphasizing structural induction and variable manipulation.
Foundations of Scala: Modelling and Type Systems
Covers the foundations of Scala, including modelling recursive types, parameterized types, and variance.
Data Abstraction: Modules and Specifications in Coq
Discusses data abstraction in programming, focusing on modules and specifications in Coq.
Inductive Propositions: Reasoning and Evaluation Techniques
Discusses inductive propositions, their definitions, and applications in reasoning and evaluation techniques in Coq.
Lambda Calculus: Operational Semantics and Evaluation Strategies
Covers operational semantics and evaluation strategies in lambda calculus, including redex, alternative evaluation strategies, and Church Booleans.
Subtyping and Type Calculus
Explores subtyping, type calculus, and type bounds calculation in a system with subtyping, guiding through exercises and proofs step by step.
Previous
Page 1 of 2
Next
