Löh, Andres and Mcbride, Conor and Swierstra, Wouter (2010) A tutorial implementation of a dependently typed lambda calculus. Fundamenta Informaticae, 102 (2). pp. 177-207. ISSN 0169-2968Full text not available in this repository. (Request a copy from the Strathclyde author)
We present the type rules for a dependently typed core calculus together with a straight-forward 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.
|Keywords:||core calculus, lambda calculus, Haskell, Electronic computers. Computer science, Computational Theory and Mathematics, Algebra and Number Theory, Theoretical Computer Science, Information Systems|
|Subjects:||Science > Mathematics > Electronic computers. Computer science|
|Department:||Faculty of Science > Computer and Information Sciences|
|Depositing user:||Pure Administrator|
|Date Deposited:||18 Nov 2011 05:21|
|Last modified:||22 Mar 2017 11:44|