First Page | Document Content | |
---|---|---|
Date: 2012-08-10 19:25:37Models of computation Type theory Symbol Dynamical system Lambda calculus Type safety Programming Computable Functions Normalisation by evaluation Theoretical computer science Computer science Software engineering | Gradual Typing for Functional Languages Jeremy G. Siek Walid Taha University of ColoradoAdd to Reading ListSource URL: repository.readscheme.orgDownload Document from Source WebsiteFile Size: 301,30 KBShare Document on Facebook |
Fundamenta Informaticae–19 1 IOS PressDocID: 1pzZ3 - View Document | |
Microsoft Word - Midlands Graduate School 2009.docDocID: 1pvqt - View Document | |
Self-Representation in Girard’s System U Keywords Lambda Calculus; Self Representation; Types 1.DocID: 1g42s - View Document | |
BRICS RS-05-4 Filinski & Rohde: Denotational Aspects of Untyped Normalization by Evaluation BRICS Basic Research in Computer ScienceDocID: 1fMbR - View Document |