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 Programs"”.

  1. Circular Reasoner: A package in Mathematica for the execution of certain otherwise non-terminating functional programs

    … package in Mathematica for the specification of functional programs using rewrite rules. The package detects certain recursions of a cyclical nature, and through repeated refinement of a set of initial guesses of final values for relevant terms, arrives at a value consistent with the equations …

    uiuc Repository record for Circular Reasoner: A package in Mathematica for the execution of certain otherwise non-terminating functional programs (opens in a new tab)

  2. Optimistic regulation of concurrency

    Unregulated concurrency in functional programs may lead to space demands that exceed available space, causing deadlock. This thesis proposes regulating concurrency optimistically with rollbacks. Excessive concurrency is viewed as a fault from which to recover. An optimistic regulator has two parts: …

    uiuc Repository record for Optimistic regulation of concurrency (opens in a new tab)

  3. Categorical semantics and composition of tree transducers

    … tree transducers and more general to fuse functional programs. The first abroach is based on initial algebras. We prove a new variant of the acid rain theorem for mutually recursive functions where the build function is substituted by a concrete functor. Moreover, we give a symmetric form …

    qucosa-diss

  4. Program Synthesis With Types

    Program synthesis, the automatic generation of programs from specification, promises to fundamentally change the way that we build software. By using synthesis tools, we can greatly speed up the time it takes to build complex software artifacts as well as construct programs that are automatically …

    penn Repository record for Program Synthesis With Types (opens in a new tab)

  5. Relational compilation: Functional-to-imperative code generation for performance-critical applications

    Purely functional programs verified using interactive theorem provers typically need to be translated to run: either by extracting them to a similar language (like Coq to OCaml) or by proving them equivalent to deeply embedded implementations (like C programs). Traditionally, the first approach is …

    mit Repository record for Relational compilation: Functional-to-imperative code generation for performance-critical applications (opens in a new tab)

  6. Compiling array computations for the Fresh Breeze Parallel Processor

    … While this model is well suited for executing functional programs, the goal of this thesis is to see if conventional programs can be efficiently compiled for this novel memory system and parallelization model, focusing specifically on array-based linear algebra computations. We compile a subset …

    mit Repository record for Compiling array computations for the Fresh Breeze Parallel Processor (opens in a new tab)

  7. An airport on display

    … The thesis focuses on displaying a sequence of functional spaces which are commonly not exposed to the eyes of the public, in this case, a general aviation airport. The greatest challenge over the course of the study was how to create displayable spaces without overlooking basic functional

    vt Repository record for An airport on display (opens in a new tab)

  8. Mathematical Tools for Discontinuous Dynamical Systems

    … lexicographical directional derivatives of functional programs is developed, extending existing methods to programs containing conditional branches and loops. A software implementation of the theoretical results is also developed. Next, well-posedness and sensitivity results are established …

    mit Repository record for Mathematical Tools for Discontinuous Dynamical Systems (opens in a new tab)

  9. Bayesian computational models for inferring preferences

    … sequential planning are represented as functional programs. Chapter 3 considers how preferences vary under different combinations (or &compositions') of outcomes. I use simple mathematical functional forms to model composition. These forms are standard in microeconomics, where the …

    mit Repository record for Bayesian computational models for inferring preferences (opens in a new tab)

  10. Effective Static Debugging via Compential Set-Based Analysis

    … under development and understanding existing programs. The key technology underlying MrSpidey is componential set-based analysis. This is a constraint-based, whole-program analysis for object-oriented and functional programs. The analysis first processes each program component (eg. module or …

    rice Repository record for Effective Static Debugging via Compential Set-Based Analysis (opens in a new tab)

  11. 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 …

    glasgow Repository record for Parallel programming using functional languages (opens in a new tab)

  12. Towards eliminating expert creative help in automated reasoning

    Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2025-03-28 without embargo terms

    uiuc Repository record for Towards eliminating expert creative help in automated reasoning (opens in a new tab)