2. DeBrujin & scoped lambda

preview_player
Показать описание
DeBruijn indices, strong reduction, abstract machines & scoped LC
  1. sequents
Рекомендации по теме
2. DeBrujin & 1:04:45

2. DeBrujin & scoped lambda

cs321 de bruijn 0:15:59

cs321 de bruijn index 2

Autosubst 2: Reasoning 0:56:03

Autosubst 2: Reasoning with de Bruijn Terms and Substitutions

Syntax with Shifted 0:21:29

Syntax with Shifted Names

De Bruijn Indices 0:05:51

De Bruijn Indices in TinyIdris

cs321 de bruijn 0:17:01

cs321 de bruijn index 1

Confused about beta-reduction/shifting 0:02:09

Confused about beta-reduction/shifting in untyped $lambda$-calculus with de Bruijn terms

Lambda Calculus Beep 0:44:28

Lambda Calculus Beep Boop (Einar W. Høst and Jonas Winje)

De Bruijn index 0:06:29

De Bruijn index

1. Untyped lambda 1:17:28

1. Untyped lambda

TTyped: A Simple 0:13:32

TTyped: A Simple Dependently Typed PL

cs321 lambda substitution 1:00:03

cs321 lambda substitution 1

The Objective Metatheory 0:32:55

The Objective Metatheory of Simply Typed Lambda Calculus

miniKanren 2021 - 0:16:51

miniKanren 2021 - A New Higher-order Unification Algorithm for λKanren

[PLDI24] Hashing Modulo 0:21:08

[PLDI24] Hashing Modulo Context-Sensitive Alpha-Equivalence

Reducing Lambda Expressions 0:13:32

Reducing Lambda Expressions

PSSV21ThirdMorningAndAfternoonSessions 2:35:12

PSSV21ThirdMorningAndAfternoonSessions

Nikolai Kudasov: Free 0:19:15

Nikolai Kudasov: Free Foil: Generating Efficient and Scope-Safe Abstract Syntax

Strongly-typed bound, part 0:07:45

Strongly-typed bound, part 1

ICFP 2020 Session 1:58:01

ICFP 2020 Session Asia 3

The full-reducing Krivine 0:10:59

The full-reducing Krivine abstract machine KN simulates pure normal-order reduction i... (ICFP 2020)

AMAT362 Lecture 18 1:08:13

AMAT362 Lecture 18

Stephanie Weirich - 0:39:35

Stephanie Weirich - How to Implement the Lambda Calculus, Quickly

Conor McBride - 1:12:06

Conor McBride - Dependently-Typed Metaprogramming 2/8: Metaprogramming the Simply-Typed λ-Calculus