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
Simply Typed Lambda Calculus: Foundations and Properties
Graph Chatbot
Related lectures (32)
Previous
Page 1 of 4
Next
Lambda Calculus and Type Safety: An Overview
Provides an overview of lambda calculus, type safety, and type inference in programming languages.
Semantics in Computer Language Processing: Understanding Meaning
Covers the semantics of programming languages, focusing on the Add language and the role of rewriting rules and CK machines in understanding meaning.
Introduction to Coq: Arithmetic Expressions and Evaluators
Covers the basics of Coq, focusing on arithmetic expressions, evaluation, and proof techniques.
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.
Hoare Logic: Foundations and Applications
Covers Hoare Logic, its foundations, applications, and significance in program verification.
Lambda Calculus: Syntax and Abstractions
Introduces terms, abstractions, applications, and values in the lambda calculus.
Inductive Propositions: Reasoning and Evaluation Techniques
Discusses inductive propositions, their definitions, and applications in reasoning and evaluation techniques in Coq.
Polymorphism in Coq: Data Structures and Functions
Covers polymorphism in Coq, focusing on data structures and functions like lists, length, and append.
Types in Lambda Calculus
Covers types in lambda calculus, including defining types, specifying rules, and proving soundness.
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.
