A Tutorial Implementation of a Dependently Typed Lambda Calculus

Abstract. We present the type rules for a dependently typed core calculus together with a straightforward implementation in Haskell. We explicitly highlight the changes necessary to shift from a simply-typed lambda calculus to the dependently typed lambda calculus. We also describe how to extend our core language with data types and write several small example programs. The article is accompanied by an executable interpreter and example code that allows immediate experimentation with the system we describe.

• Type: Journal
• Year: 2010
• Where: FUIN
• Authors: Andres Löh, Conor McBride, Wouter Swierstra
• Keywords: Core Calculus, FUIN 2010, Simply-typed Lambda, Typed Lambda Calculus