Search for dissertations about: "Lambda-calculus"

Showing result 1 - 5 of 12 swedish dissertations containing the word Lambda-calculus.

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

    Author : David Wahlstedt; Chalmers tekniska högskola; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Pattern-matching; Reducibility; Size-Change Termination; Logical Framework; Lambda-calculus; Term rewriting.; Type Theory; Dependent types; Normalization; Type system;

    Abstract : 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. READ MORE

  4. 2. Internalizing Parametricity

    Author : Guilhem Moulin; Chalmers tekniska högskola; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Type structure; Presheaf Model; Parametricity; Lambda Calculus; Polymorphism;

    Abstract : 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. READ MORE

  5. 3. Pure Type Systems with an Internalized Parametricity Theorem

    Author : Guilhem Moulin; Chalmers tekniska högskola; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Type structure; Polymorphism; Lambda Calculus.; Parametricity;

    Abstract : 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. READ MORE

  6. 4. Testing an Optimising Compiler by Generating Random Lambda Terms

    Author : Michal Palka; Chalmers tekniska högskola; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; functional programming; software testing; random testing; type systems; lambda calculus;

    Abstract : 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. READ MORE

  7. 5. Testing and Proving in Dependent Type Theory

    Author : Qiao Haiyan; Chalmers tekniska högskola; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES;

    Abstract : We show how random testing, model checking and interactive proving can be combined for functional program verification in dependent type theory. We extend the proof assistant Agda/Alfa for dependent type theory with a tool for random testing of functional programs, thus combining proving and testing in one system. READ MORE