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
Type Rules: Progress and Preservation
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.
Hoare Logic: Foundations and Applications
Covers Hoare Logic, its foundations, applications, and significance in program verification.
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.
Operational Semantics: Amyli Language
Covers the Amyli language, including abstract syntax, program representation, and operational semantics.
Polymorphism in Coq: Data Structures and Functions
Covers polymorphism in Coq, focusing on data structures and functions like lists, length, and append.
An Introduction to Iris: Higher-Order Concurrent Separation Logic
Introduces Iris, a logical framework for reasoning about safety and correctness of concurrent higher-order imperative programs, emphasizing its unique characteristics and applications.
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.
Compiler Extension Lab
Covers the Compiler Extension Lab, focusing on adding new functionality to a simple functional language compiler.
Music Semantics: Problems and Prospects
Explores music semantics, discussing inferences triggered by different musical elements and proposing a framework for understanding music's meaning.
Type Inference: Hindley-Milner Overview
Explores type inference algorithms and rules, including Hindley-Milner type inference for statically typed languages.
