Search for dissertations about: "Lazy Algorithm"

Showing result 1 - 5 of 6 swedish dissertations containing the words Lazy Algorithm.

2. 1. Code Optimisation Techniques for Lazy Functional Languages

   Author : Urban Boquist; Chalmers tekniska högskola; []
   Keywords : NATURVETENSKAP; NATURAL SCIENCES; graph reduction; garbage collection; lazy functional languages; program transformation; interprocedural register allocation; graph colouring; intermediate code; code optimisation; compiler back-end;

   Abstract : This thesis describes a complete compiler back-end for lazy functional languages, which uses various interprocedural optimisations to produce highly optimised code. The most important contributions of this work are the following. READ MORE

4. 2. Bounded Rationality and Exemplar Models

   Author : Magnus Persson; Peter Juslin; Nick Chater; Uppsala universitet; []
   Keywords : SAMHÄLLSVETENSKAP; SOCIAL SCIENCES; Psychology; PROBEX; Lazy Algorithm; Probabilistic Inference; Decision Making; Bounded Rationality; Ecological Rationality; Take The Best; exemplar models; correspondence; Psykologi; Psychology; Psykologi; Psychology; psykologi;

   Abstract : Bounded rationality is the study of how human cognition with limited capacity is adapted to handle the complex information structures in the environment. This thesis argues that in order to understand the bounded rationality of decision processes, it is necessary to develop decision theories that are computational process models based upon basic cognitive and perceptual mechanisms. READ MORE

5. 3. A Type Theoretical Analysis of Some Aspects of Programming Languages

   Author : Verónica Gaspes; Chalmers tekniska högskola; []
   Keywords : NATURVETENSKAP; NATURAL SCIENCES;

   Abstract : We present three papers on the application of Martin-Löf's type theory to the analysis of programming languages. In the first paper, we present formal proofs in type theory of the combinatorial completeness of two calculi of combinators. The statement formulates the ability of the calculi to describe functions. READ MORE

6. 4. Types for Crash Preventionn

   Author : Lars Pareto; Chalmers tekniska högskola; []
   Keywords : NATURVETENSKAP; NATURAL SCIENCES; reliability; dependability; concurrent programming; denotational semantics; real-time systems and embedded systems; data-flow; dynamic storage management; applicative functional programming languages ; type systems;

   Abstract : This thesis seeks to strengthen the capabilities of static polymorphic type-checking (as known from typed lambda calculus and functional programming) to allow a larger class of programming errors to be caught at compile time: the goal is to not only prevent illegal uses of data, but to also errors that lead to busy-loops, deadlocks, stack-overflows and heap-overflows. The thesis exploits that, for recursive programs, many correctness properties (including freedom from errors leading to busy-loops, etc. READ MORE

7. 5. Programming Abstractions and Optimization Techniques for GPU-based Heterogeneous Systems

   Author : Lu Li; Christoph Kessler; Welf Löwe; Thomas Fahringer; Linköpings universitet; []
   Keywords : NATURVETENSKAP; NATURAL SCIENCES; CPU; GPU; GPGPU; heterogeneous systems; programming abstraction; performance optimization; energy optimization; adaptive sampling; MeterPU; TunerPU; XPDL; VectorPU;

   Abstract : CPU/GPU heterogeneous systems have shown remarkable advantages in performance and energy consumption compared to homogeneous ones such as standard multi-core systems.Such heterogeneity represents one of the most promising trendsfor the near-future evolution of high performance computing hardware. READ MORE