Sökning: "Lambda Calculus"

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

  1. 1. Testing an Optimising Compiler by Generating Random Lambda Terms

    Författare :Michal Palka; [2012]
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; functional programming; software testing; random testing; type systems; lambda calculus;

    Sammanfattning : This thesis tries to improve on the relatively uncommon practice of random testing of compilers.Random testing of compilers is difficult and not widespread for two reasons. First, it is hard to come up with a generator of valid test data for compilers, that is a generator of programs. LÄS MER

  2. 2. Programming Language Design - Issues in Web Programming and Security

    Detta är en avhandling från Göteborg : Chalmers University of Technology

    Författare :Niklas Broberg; Göteborgs universitet.; Gothenburg University.; [2006]
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Functional programming; web programming; dynamic loading; regular expressions; security; non-interference; calculus; core calculus; bisimulation;

    Sammanfattning : This thesis consists of two separate parts. Both concernprogramming language design, the first in the domain ofweb programming and the other for security. LÄS MER

  3. 3. Type Theory with First-Order Data Types and Size-Change Termination

    Detta är en avhandling från Göteborg : Chalmers University of Technology

    Författare :David Wahlstedt; [2004]
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Pattern-matching; Reducibility; Size-Change Termination; Logical Framework; Lambda-calculus; Term rewriting.; Type Theory; Dependent types; Normalization; Type system;

    Sammanfattning : We prove normalization for a dependently typed lambda-calculus extended with first-order data types and computation schemata for first-order size-change terminating recursive functions. Size-change termination, introduced by C.S. Lee, N. LÄS MER

  4. 4. Pure Type Systems with an Internalized Parametricity Theorem

    Detta är en avhandling från Göteborg : Chalmers University of Technology

    Författare :Guilhem Moulin; [2013]
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Type structure; Polymorphism; Lambda Calculus.; Parametricity;

    Sammanfattning : Parametricity results have recently been proved for dependently-typed calculi such as the Calculus of Constructions. However these results are meta theorems, and although they can be stated as internal propositions, they cannot be proved internally. LÄS MER

  5. 5. Internalizing Parametricity

    Detta är en avhandling från Göteborg : Chalmers University of Technology

    Författare :Guilhem Moulin; [2016]
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Type structure; Presheaf Model; Parametricity; Lambda Calculus; Polymorphism;

    Sammanfattning : Parametricity results have recently been proved for dependently-typed calculi such as the Calculus of Constructions. However these results are meta theorems, and although the theorems can be stated as internal propositions, they cannot be proved internally. LÄS MER