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 12 of 12 for “"Functional programming (Computer science)"”.
-
Automatic complexity analysis of logic programs.
… primarily in the context of imperative and functional languages. This dissertation extends these techniques to logic programs so that they can handle nondeterminism, namely, the generation of multiple solutions via backtracking. We describe the design and implementation of a (semi)-automatic …
-
Theory and practice of shortcut fusion
… for eliminating intermediate data structures in functional programs by rewriting a composition of recursive functions as a single recursive function. Such a transformation is called <em>fusion</em>. One such approach is to encapsulate a structured recursion scheme in two combinators for …
-
Structural foundations for differentiable programming
… semantics is a powerful tool to study and design programming languages. It focuses on the foundational aspects of differentiable programming in a simply typed functional setting. Although most of the category theory used can be boiled down to a more elementary presentation, its influence was …
-
Implementing a Functional Logic Programming Language via the Fair Scheme
This document presents a new compiler for the Functional Logic programming language Curry based on a novel pull-tabbing evaluation strategy called the Fair Scheme. A simple version of the Fair Scheme is proven sound, complete, and optimal. An elaborated version is also developed, which supports …
-
Irrelevance, Polymorphism, and Erasure in Type Theory
… type theory is a proven technology for verified functional programming in which programs and their correctness proofs may be developed using the same rules in a single formal system. In practice, large portions of programs developed in this way have no computational relevance to the ultimate …
-
Continuation-Passing Style Versus Direct Style: Choosing an Intermediate Representation For Higher-Order Applicative Languages
This study analyzes the use of a continuation-passing style (CPS) intermediate representation versus a direct style intermediate representation in the compilation of a higher-order applicative language. The translator used accepts a program written in an ML-like language as input, and outputs a C …
-
Making Curry with Rice: An Optimizing Curry Compiler
… we present the RICE optimizing compiler for the functional logic language Curry. This is the first general optimizing compiler for a functional logic language. Our work is based on the idea of compiling through program transformations, which we have adapted from the functional language compiler …
-
TeaBag: A Debugger for Curry
… thesis describes TeaBag, which is a debugger for functional logic computations. TeaBag is an accessory of a virtual machine currently under development. A distinctive feature of this machine is its operational completeness of computations, which places novel demands on a debugger. This thesis …
-
Type Classes and Instance Chains: A Relational Approach
… first proposed during the design of the Haskell programming language, extend standard type systems to support overloaded functions. Since their introduction, type classes have been used to address a range of problems, from typing ordering and arithmetic operators to describing heterogeneous lists …
-
Force-Directed Graph Drawing and Aesthetics Measurement in a Non-Strict Pure Functional Programming Language
Non-strict pure functional programming often requires redesigning algorithms and data structures to work more effectively under new constraints of non-strict evaluation and immutable state. Graph drawing algorithms, while numerous and broadly studied, have no presence in the non-strict pure …
-
Relativistic Causal Ordering A Memory Model for Scalable Concurrent Data Structures
… hardware. However, the available concurrent programming models force a difficult choice, between simple models such as mutual exclusion that produce little to no concurrency, or complex models such as Read-Copy Update that can scale to all available resources. Simple concurrent programming …
-
The Basic Scheme for the Evaluation of Functional Logic Programs
Functional logic languages provide a powerful programming paradigm combining the features of functional languages and logic languages. However, current implementations of functional logic languages are complex, slow, or both. This thesis presents a scheme, called the Basic Scheme, for compiling and …