Date: 2014-11-03 10:29:10Lambda calculus Logic programming Type theory Predicate logic ΛProlog Unification Free variables and bound variables Simply typed lambda calculus Higher-order abstract syntax Logic Mathematics Theoretical computer science | | Abstract syntax for variable binders: An overview Dale Miller Department of Computer Science and Engineering 220 Pond Laboratory, The Pennsylvania State University University Park, PAUSA Add to Reading ListSource URL: www.lix.polytechnique.frDownload Document from Source Website File Size: 170,51 KBShare Document on Facebook
|