Advanced tutorial showing how to make a typed tagless-final interpreter for a full linear lambda calculus using higher-order abstract syntax.
Typed Tagless-Final Linear Lambda Calculus
As of March 2020, School of Haskell has been switched to read-only mode.
0 Introduction 24 Apr 2013mutjida
Introduction and a quick review of minimal linear lambda calculus.1 deBruijn Typed Tagless-Final Interpreter 24 Apr 2013mutjida
A first order, baed on deBruijn indices, interpreter for purely linear minimal LLC..2 HOAS Typed Tagless-Final Interpreter 24 Apr 2013mutjida
A higher-order (HOAS) interpreter for purely linear minimal LLC.3 Adding Regular Lambdas 24 Apr 2013mutjida
Extending the purely linear minimal LLC interpreter to include regular functions.4 Full Linear Lambda Calculus 24 Apr 2013mutjida
Brief introduction to full LLC including additives and units.5 Efficient Resource Management 25 Apr 2013mutjida
Implementation of an interpreter for full LLC using an efficient version of the typing rules.6 Recursive Types 25 Apr 2013mutjida
Extension of full LLC to include recursive types so that interesting programs can be written.
