Sökning: "Lambda Calculus"

Visar resultat 11 - 12 av 12 avhandlingar innehållade orden Lambda Calculus.

  1. 11. Types for Crash Preventionn

    Författare :Lars Pareto; Chalmers tekniska högskola; []
    Nyckelord :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;

    Sammanfattning : 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. LÄS MER

  3. 12. Type Based Techniques for Covert Channel Elimination and Register Allocation

    Författare :Johan Agat; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; type and effect systems; program analysis; functional languages; confidentiality; register allocation; privacy; computer security; covert timing channels; program transformation; information flow; type systems;

    Sammanfattning : As the title suggests, this thesis consists of two parts that address two rather different topics. The first part investigates secure information flow in sequential programs, with the aim of completely eliminating covert timing channels. The second part presents a technique to describe register allocation for a functional language. LÄS MER