Skip to main content
Graph
Search
fr
en
Login
Search
All
Categories
Concepts
Courses
Lectures
MOOCs
People
Quizes
Exercises
Publications
Startups
Units
Show all results for
Home
Lecture
Lazy Evaluation: Introduction and Examples
Graph Chatbot
Related lectures (30)
Termination Analysis using Dependency Pairs
Explores automated termination analysis using dependency pairs, covering classical and modern techniques, annual competitions, and tools like AProVE.
Monads: Concepts and Applications
Explores monads, their laws, Scala implementation, and practical applications in functional programming.
Encoding Recursion as Self-Application
Explores lambda calculus, higher-order functions, and recursive function encoding.
Programming Paradigms: Functional, OOP, Polymorphism
Log in to Mediaspace to watch this video
Explores programming paradigms like procedural, functional, and OOP, with examples in Python.
Programming Models: Overview and Examples
Log in to Mediaspace to watch this video
Explores programming models for big data processing, including Spark's RDDs and optimizations.
Lambda Calculus and Type Safety: An Overview
Log in to Mediaspace to watch this video
Provides an overview of lambda calculus, type safety, and type inference in programming languages.
Introduction to Coq: Arithmetic Expressions and Evaluators
Log in to Mediaspace to watch this video
Covers the basics of Coq, focusing on arithmetic expressions, evaluation, and proof techniques.
Big-step semantics: Defining arithmetic expressions and commands
Log in to Mediaspace to watch this video
Covers the definition of a simple programming language and its big-step semantics, including arithmetic expressions and imperative commands.
Simply Typed Lambda Calculus: Foundations and Properties
Log in to Mediaspace to watch this video
Covers the simply typed lambda calculus, focusing on its syntax, semantics, and type system properties such as progress and preservation.
Inductive Propositions: Understanding Evaluation in Coq
Log in to Mediaspace to watch this video
Covers inductive propositions in Coq, focusing on evaluation rules for arithmetic expressions and their applications in defining partial and non-deterministic functions.
Previous
Page 2 of 2
Next