Sökning: "Haskell"
Visar resultat 26 - 30 av 41 uppsatser innehållade ordet Haskell.
26. The Hopper language- A Haskell-like language on the Erlang VM
Kandidat-uppsats, Göteborgs universitet/Institutionen för data- och informationsteknikSammanfattning : The following report aims to give insight into the design and implementation of a statically typed functional language for the Erlang virtual machine, discussing how such an implementation may be approached and whether it appears to be feasible. The primary goal of the project was to design a grammar specification and implement a compiler for such a language. LÄS MER
27. SWAP-IFC Secure Web Applications with Information Flow Control
Master-uppsats, Göteborgs universitet/Institutionen för data- och informationsteknikSammanfattning : This thesis explores the possibility to create a library in Haskell which enables a static analysis with regards to information flow control. This library should then be compiled with Haste and produce secure JavaScript code with regards to information flow control. LÄS MER
28. The impact of corporate social responsibility on intrinsic and extrinsic employee motivation : A mixed-method study of Sodexo
Uppsats för yrkesexamina på avancerad nivå, Umeå universitet/FöretagsekonomiSammanfattning : Corporate social responsibility (CSR) is a subject that has gained more attention over the last two decades, and it is seen today as an integral part of the core strategy of many companies. The subject often involves a balancing act between many stakeholder interests, where employees often are mentioned as a main stakeholder group. LÄS MER
29. Compositional Decompilation using LLVM IR
Kandidat-uppsats, Uppsala universitet/Institutionen för informationsteknologiSammanfattning : Decompilation or reverse compilation is the process of translating low-level machine-readable code into high-level human-readable code. The problem is non-trivial due to the amount of information lost during compilation, but it can be divided into several smaller problems which may be solved independently. LÄS MER
30. API-Driven Generation of Well-Typed Terms
Master-uppsats, Göteborgs universitet/Institutionen för data- och informationsteknikSammanfattning : In this thesis, a reusable library for defining generators for well-typed expressions in standard Haskell is presented. The expressions are randomly constructed from a set of functions and values specified by a user. Both the types of these functions and the type of the generated expression can be polymorphic and/or higher order, i.e. LÄS MER