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 33 for “"Lazy evaluation"”.

  1. Very Lazy Evaluation - A new execution model for functional programming languages

    … on graph-reduction but a new concept called very lazy evaluation. It uses an unconventional approach to evaluate expressions of the λ-calculus, that differs considerably from traditional term rewrite systems. Its method to perform function applications allows arguments to be handled in a way, that …

    chalmers Repository record for Very Lazy Evaluation - A new execution model for functional programming languages (opens in a new tab)

  2. Tingus vykdymas pirmos Futamura projekcijos interpretatorių karkase Truffle /

    The paper defines a functional language with lazy evaluation. An interpreter using Futamura projection based interpreter framework Truffle is implemented. The interpreter is more performant than GHCi interpreter, but less performant than GHC compiler.

    vilnius Repository record for Tingus vykdymas pirmos Futamura projekcijos interpretatorių karkase Truffle / (opens in a new tab)

  3. Interoperation for Lazy and Eager Evaluation

    … model of computation that resolves incompatible lazy and eager eval- uation strategies using dual notions of evaluation contexts and values to mirror the lazy evaluation strategy in the eager one. This method could be extended to resolve incompatible evaluation strategies for any pair of …

    calpoly Repository record for Interoperation for Lazy and Eager Evaluation (opens in a new tab)

  4. A network transparent, retained mode multimedia processing framework for the Linux operating system environment

    … auf den Ideen "retained-mode processing" und "lazy evaluation" basiert: Statt Transformationen unmittelbar auszuführen, wird eine abstrakte Repräsentation aller Medienelemente aufgebaut. "renderer"-Treiber fungieren als Übersetzer, die diese Darstellung zur Laufzeit in konkrete Operationen …

    qucosa-diss

  5. GCC plugin pro statické analyzátory

    … anotačních službách s odloženým vyhodnocováním (lazy evaluation), jednotném rozhraní pro analyzátory a podpoře exportu do JSON pro offline zpracování. Řešení zachovává zpětnou kompatibilitu s nástrojem Predator prostřednictvím adaptéru, který rekonstruuje původní proud zpětných volání z nového …

    brno-tech Repository record for GCC plugin pro statické analyzátory (opens in a new tab)

  6. An extended spreadsheet paradigm for data visualisation systems, and its implementation

    … as the formula language and we make use of lazy evaluation. The novel combination of these techniques makes our system consistently declarative in nature, and gives it several advantages such as small, uncluttered visual programs, the ability to deal with arbitrarily large datasets and the …

    cape-town Repository record for An extended spreadsheet paradigm for data visualisation systems, and its implementation (opens in a new tab)

  7. Improving Memory Consumption with FAITH - a Proof Assistant for Improvement Theory

    In functional languages with lazy evaluation and sharing, such as Haskell, it is hard to reason about space usage. In particular, it is hard to know if a given local transformation in such a language will introduce an asymptotic space increase. Gustavsson and Sands have developed Space Improvement …

    chalmers Repository record for Improving Memory Consumption with FAITH - a Proof Assistant for Improvement Theory (opens in a new tab)

  8. Java exception matching in real time using fuzzy logic

    … the original Levenshtein algorithm - utilizing lazy evaluation and thresholding - was determined the best suited comparison algorithm for this problem. Sammanfattning Den här examenstesen berör problemet om att matcha avbrott i Java (eng: exceptions) som härrör från samma problem, men av olika …

    chalmers Repository record for Java exception matching in real time using fuzzy logic (opens in a new tab)

  9. Variations of A* for searching in abstraction hierarchies.

    … abstract space. This approach is referred to as Lazy Evaluation. Another of our objectives is to achieve more speed in search sacrificing optimality. For this we introduce a technique called Selective Method. Our last objective is to identify which abstraction method is the best for the search. …

    ottawa-retro Repository record for Variations of A* for searching in abstraction hierarchies. (opens in a new tab)

  10. A DDDAS framework for managing online transportation systems

    … estimates and computationally accelerated with a lazy evaluation and speculative execution scheme, termed Superimposed Execution. This technique can be used to simulate objects that travel in a spatial network and where collected output statistics are limited to a single entity. Under mild …

    gatech Repository record for A DDDAS framework for managing online transportation systems (opens in a new tab)

  11. Design, implementation and calculation of circular programs

    … algorithms as a single traversal function in a lazy setting. Such a (virtual) circular program may contain circular definitions, that is, arguments of function calls that are also results of that same calls. Although circular definitions always induce non-termination under a strict evaluation …

    minho-thes Repository record for Design, implementation and calculation of circular programs (opens in a new tab)

  12. Eager, Lazy, and Other Executions for Predicative Programming

    … orders in use. One such order in common use is lazy execution or lazy evaluation, which is mostly demand-driven. Laziness supports better decompositions of algorithms, e.g., into modular producers and consumers, which enables compositional reasoning of answer correctness, but then timing …

    toronto-retro Repository record for Eager, Lazy, and Other Executions for Predicative Programming (opens in a new tab)

  13. On the Implementation of Purely Functional Data Structures for the Linearisation case of Dynamic Trees

    … de facto sequence data structure for the purely lazy-evaluation programming language Haskell – they are augmented with collection (i.e. set-based) data structures in order to manage efficiently k-ary trees for the so-called linearisation case of the dynamic trees problem. Different …

    whiterose Download PDF for On the Implementation of Purely Functional Data Structures for the Linearisation case of Dynamic Trees (opens in a new tab)

  14. Assignment Calculus: A Pure Imperative Reasoning Language

    … definitions, we can incorporate L-values, lazy evaluation, state backtracking, and procedure composition into AC. By incorporating procedure composition, we show that AC becomes a self-contained Turing complete language in the same way as the untyped λ-calculus: by encoding numerals, …

    mcmaster Repository record for Assignment Calculus: A Pure Imperative Reasoning Language (opens in a new tab)

  15. Execution Profiling for Non-Strict Functional Languages

    … 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 dynamically-gathered statistics back to the original source. This thesis examines the difficulties of …

    glasgow Download PDF for Execution Profiling for Non-Strict Functional Languages (opens in a new tab)

  16. Ο νοηματικός μετασχηματισμός ως τεχνική υλοποίησης συναρτησιακών γλωσσών προγραμματισμού

    … that can still be implemented using familiar lazy evaluation techniques on mainstream computers. The main contributions of this work are:(1) We present the generalized intensional transformation, an extension of the classic intensional transformation that can handle languages with user-defined …

    greece Repository record for Ο νοηματικός μετασχηματισμός ως τεχνική υλοποίησης συναρτησιακών γλωσσών προγραμματισμού (opens in a new tab)

  17. Functional Logic Programming with Static Determinism Analysis

    … with a particular focus on the combination of lazy evaluation and non-determinism. Functional logic languages combine functional and logic programming paradigms, enabling a flexible and expressive programming environment. The first main contribution is the development of a monadic run-time …

    cau-kiel Repository record for Functional Logic Programming with Static Determinism Analysis (opens in a new tab)

  18. Analyzing Structured Scenarios by Tracking People and Their Limbs

    … constraints and uses AND/OR search and lazy evaluation to efficiently obtain the globally optimal solution in each frame. Our high-level reasoning framework efficiently and robustly interprets noisy visual observations to deduce the events comprising structured scenarios. This is …

    maryland Repository record for Analyzing Structured Scenarios by Tracking People and Their Limbs (opens in a new tab)

  19. Composing graphical user interfaces in a purely functional language

    … functions, polymorphic type systems, lazy evaluation, and systematic overloading, that together pack quite a punch, at least according to proponents of these languages. A secondary contribution of this thesis is to present a compositional user interface framework called Haggis, which …

    glasgow Download PDF for Composing graphical user interfaces in a purely functional language (opens in a new tab)

Page 1 of 2