Search for dissertations about: "type checking"

Showing result 1 - 5 of 32 swedish dissertations containing the words type checking.

  1. 1. Practical Unification for Dependent Type Checking

    Author : Víctor López Juan; Chalmers tekniska högskola; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; unification; type checking; dependent types; Functional Programming;

    Abstract : When using popular dependently-typed languages such as Agda, Idris or Coq to write a proof or a program, some function arguments can be omitted, both to decrease code size and to improve readability.  Type checking such a program involves inferring a combination of these implicit arguments that makes the program type-correct. READ MORE

  2. 2. Practical Heterogeneous Unification for Dependent Type Checking

    Author : Víctor López Juan; Chalmers tekniska högskola; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; unification; dependent types; type checking;

    Abstract : Dependent types can specify in detail which inputs to a program are allowed, and how the properties of its output depend on the inputs. A program called the type checker assesses whether a program has a given type, thus detecting situations where the implementation of a program potentially differs from its intended behaviour. READ MORE

  3. 3. Regular Model Checking

    Author : Marcus Nilsson; Bengt Jonsson; Parosh Aziz Abdulla; Kim Larsen; Uppsala universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; formal methods; model checking; verification; regular sets; Computer science; Datavetenskap;

    Abstract : A major current challenge in the area of program verification is to extend its applicability to infinite-state systems. A system can be infinite-state because it operates on unbounded data structures, such as queues, stacks, integers, etc., or because its description is parameterized by the number of components inside the system. READ MORE

  4. 4. Towards a practical programming language based on dependent type theory

    Author : Ulf Norell; Chalmers tekniska högskola; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; dependent types; type theory; metavariables; programming; pattern matching; type checking;

    Abstract : Dependent type theories have a long history of being used for theorem proving. One aspect of type theory which makes it very powerful as a proof language is that it mixes deduction with computation. READ MORE

  5. 5. Descriptive Types for XML Query Language Xcerpt

    Author : Artur Wilk; Jan Maluszynski; Jørgen Fischer Nilsson; Linköpings universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Type system; XML querying; Xcerpt; Type inference; Type definitions; Computer science; Datavetenskap;

    Abstract : The thesis presents a type system for a substantial fragment of XML query language Xcerpt. The system is descriptive; the types associated with Xcerpt constructs are sets of data terms and approximate the semantics of the constructs.A formalism of Type Definitions, related to XML schema languages, is adopted to specify such sets. READ MORE