Search for dissertations about: "functor"

Showing result 1 - 5 of 24 swedish dissertations containing the word functor.

  2. 1. The Theory of Polynomial Functors

    Author : Qimh Xantcha; Torsten Ekedahl; Vincent Franjou; Stockholms universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; numerical ring; polynomial map; strict polynomial map; numerical map; polynomial functor; strict polynomial functor; numerical functor; maze; multi-set; multation; Algebra and geometry; Algebra och geometri; Mathematics; matematik;

    Abstract : Polynomial functors were introduced by Professors Eilenberg and Mac Lane in 1954, who used them to study certain homology rings. Strict polynomial functors were invented by Professors Friedlander and Suslin in 1997, in order to develop the theory of group schemes. READ MORE

  4. 2. Families of cycles and the Chow scheme

    Author : David Rydh; Dan Laksov; Martin Olsson; KTH; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Families of cycles; Chow scheme; Hilbert scheme; zero-cycles; divided powers; symmetric tensors; symmetric product; Weil restriction; norm functor; Algebra and geometry; Algebra och geometri;

    Abstract : The objects studied in this thesis are families of cycles on schemes. A space — the Chow variety — parameterizing effective equidimensional cycles was constructed by Chow and van der Waerden in the first half of the twentieth century. Even though cycles are simple objects, the Chow variety is a rather intractable object. READ MORE

  5. 3. Structure-driven derivation of inter-lingual functor-argument trees for multi-lingual generation

    Author : Stefan Svenberg; Linköpings universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES;

    Abstract : We show how an inter-lingual representation o messages can be exploited for natural language generation of technical documentation into Swedish and English in a system called Genie. Genie has a conceptual knowledge base of the facts considered as true in the domain. A user queries the knowledge base for the facts she wants the document to include. READ MORE

  6. 4. Representation of Compositional Relational Programs

    Author : Görkem Paçacı; Andreas Hamfelt; Alberto Pettorossi; Uppsala universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; Programming; Syntax; Logic Programming; Combilog; CombInduce; Prolog; Variable-free; Point-free; Tacit; Compositional Relational Programming; Combinatory Logic; Predicate-Functor Logic; Program Synthesis; Meta-interpreters; Meta-interpretative Synthesis; Decompositional Synthesis; Inductive Synthesis; Inductive Logic Programming; Usability; Cognitive Dimensions of Notations; Visual Variables; Usability testing; Programming Language usability; Empirical evidence; Informationssystem; Information Systems;

    Abstract : Usability aspects of programming languages are often overlooked, yet have a substantial effect on programmer productivity. These issues are even more acute in the field of Inductive Synthesis, where programs are automatically generated from sample expected input and output data, and the programmer needs to be able to comprehend, and confirm or reject the suggested programs. READ MORE

  7. 5. Compactifying locally Cohen-Macaulay projective curves

    Author : Morten Hønsen; Dan Laksov; Kristian Ranestad; KTH; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Cohen-Macaulay compactification; curves; algebraic space; Algebra and geometry; Algebra och geometri;

    Abstract : We define a moduli functor parametrizing finite maps from a projective (locally) Cohen-Macaulay curve to a fixed projective space. The definition of the functor includes a number of technical conditions, but the most important is that the map is almost everywhere an isomorphism onto its image. READ MORE