Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 83 for “"Functional Languages"”.
-
Interacting with functional languages
Functional languages are mathematically pure, and easier to reason about than their imperative rivals. Because of this, they are an attractive paradigm of programming. They allow programmers to express complex algorithms in a declarative manner, resulting in powerful programs that are also well …
-
Parallel programming using functional languages
It has been argued for many years that functional programs are well suited to parallel evaluation. This thesis investigates this claim from a programming perspective; that is, it investigates parallel programming using functional languages. The approach taken has been to determine the minimum …
-
Verified optimizations for functional languages
… systems. It allows programmers to write purely functional programs and verify them against specifications with machine-checked proofs. After verification, one can use Coq's extraction plugin to obtain a program (in OCaml, Haskell, or Scheme) that can be compiled and executed. However, bugs in …
-
Graph rewriting and functional languages
Contains fulltext : mmubn000001_157696901.pdf (Publisher’s version ) (Open Access)
-
Dynamic extension of typed functional languages
… problem of dynamic extension in statically typed functional languages with type erasure. The presented solution retains the benefits of static checking, including type safety, aggressive optimizations, and native code compilation of components, while allowing extensibility of programs at runtime. …
-
Implementation of functional languages with state
Imperative and functional programming are two styles which have long been viewed as incompatible. In particular, the functional property of referential transparency could not be maintained in the face of destructive update, as found in assignment statements. Recent work, however, has suggested that …
-
Cost semantics for heterogeneous parallel functional languages
… they employ, user-visible parallelism in our languages becomes increasingly homogeneous, with the parallelization onus put more and more on the compiler or runtime. This increasing divide between what is seen and what happens in our languages makes being able to determine the costs of running …
-
Execution Profiling for Non-Strict Functional Languages
… A variety of such tools exist for conventional languages, but almost none for non-strict functional languages. There is a good reason for this: lazy evaluation means that the program is executed in an order which is not immediately apparent from the source code, so it is difficult to relate …
-
Cheap deforestation for non-strict functional languages
In functional languages intermediate data structures are often used as glue to connect separate parts of a program together. Deforestation is the process of automatically removing intermediate data structures. In this thesis we present and analyse a new approach to deforestation. This new approach …
-
Networked workstations and parallel processing utilizing functional languages
Alternative computer architectures are necessary to replace the traditional 'von Neumann' computer organization in order to obtain large increases in performance. The traditional 'von Neumann' architecture uses a timer based (e.g., the program counter), sequentially programmed, single processor …
-
Compiling dynamic languages via statically typed functional languages
Dynamic languages enable rapid prototyping, but are generally not viewed as providing the best performance. As a result, software developers generally build a prototype in a dynamic language and then rewrite the application in C or Fortran for high performance. This costly rewriting step can be …
-
Compilation by Transformation in Non-Strict Functional Languages
… incorporation in optimising compilers for lazy functional languages.
-
Exploring parallelism on pure functional languages with ACQuA
… to create and synchronize threads. A pure functional language is an adequate tool for this task both from the architectural point of view and from the developer’s. We will show that an architecture can benefit from the implicit parallelism present on functional programs and from the lack of …
-
Catamorphism-based program transformations for non-strict functional languages
In functional languages intermediate data structures are often used as glue to connect separate parts of a program together. These intermediate data structures are useful because they allow modularity, but they are also a cause of inefficiency: each element need to be allocated, to be examined, and …
-
The implementation of functional languages on an object-oriented architecture
… of different implementation strategies for functional languages on a novel platform, the Rekursiv, that provides hardware support for an object- oriented language (Lingo) which was used as the implementation language for this work.<br/><br/>The objective is to evaluate the performance of two …
-
Efficient list manipulation in combinator-based functional languages on parallel architectures
… and list structure make the execution of functional programs faster on both sequential and parallel architectures.</p>
-
Towards a Practical Execution Model for Functional Languages with Linear Types
Typed functional programming has an attractive logical foundation which ensures safety and modularity. System-level programming, on the other hand, offers finegrained control over program execution. Is there a way to combine those two strengths? In this thesis, we take a first step in compiling …
Page 1 of 5