000084805 001__ 84805
000084805 005__ 20180317093321.0
000084805 037__ $$aSTUDENT
000084805 245__ $$aThe SLinks Language
000084805 269__ $$a2005
000084805 260__ $$c2005
000084805 336__ $$aStudent Projects
000084805 520__ $$aThis report presents a prototype interpreter for a simple functional language, called SLinks. The focus of this work is two-fold. One side is the design of a type inference system, based on the Hindley-Milner algorithm, with additional support for record and variant types. This type system is similar to row variable based systems as described by Rémy and Wand. The other side is the support of database querying from within the language. In particular, the focus is on automatic optimisation of SLinks expressions into SQL queries. The resulting prototype, that tested and will be used to test techniques for Philip Wadler’s upcoming Links language, was heavily inspired by Wong’s Kleisi and CPL language. It does however extends it in various ways, in particular as far as record and variant operators are handled in typing and SQL optimisation.
000084805 6531_ $$aProgramming language
000084805 6531_ $$aFunctional programming
000084805 6531_ $$aDatabase
000084805 6531_ $$aQuery
000084805 6531_ $$aSQL
000084805 6531_ $$aType system
000084805 700__ $$0241948$$aDubochet, Gilles$$g139175
000084805 8564_ $$s370186$$uhttps://infoscience.epfl.ch/record/84805/files/slinks_03_2005.pdf$$zn/a
000084805 909CO $$ooai:infoscience.tind.io:84805$$pIC
000084805 909C0 $$0252187$$pLAMP$$xU10409
000084805 937__ $$aLAMP-STUDENT-2006-001
000084805 973__ $$aEPFL$$sPUBLISHED
000084805 980__ $$aSTUDENT