Sökning: "Point-free"

Visar resultat 1 - 5 av 7 avhandlingar innehållade ordet Point-free.

1. 1. Representation of Compositional Relational Programs

   Författare :Görkem Paçacı; Andreas Hamfelt; Alberto Pettorossi; Uppsala universitet; []
   Nyckelord :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;

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

3. 2. Contributions to Pointfree Topology and Apartness Spaces

   Författare :Anton Hedin; Erik Palmgren; Viggo Stoltenberg-Hansen; Peter Schuster; Uppsala universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Constructive mathematics; General topology; Pointfree topology; Domain theory; Interval analysis; Apartness spaces; Mathematical logic; Matematisk logik; Mathematical Logic; Matematisk logik;

   Sammanfattning : The work in this thesis contains some contributions to constructive point-free topology and the theory of apartness spaces. The first two papers deal with constructive domain theory using formal topology. LÄS MER

4. 3. Generalised Ramsey numbers and Bruhat order on involutions

   Författare :Mikael Hansson; Axel Hultman; Jan Snellman; Jonas Sjöstrand; Linköpings universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES;

   Sammanfattning : This thesis consists of two papers within two different areas of  combinatorics.Ramsey theory is a classic topic in graph theory, and Paper A deals with two of its most fundamental problems: to compute Ramsey numbers and to characterise critical graphs. More precisely, we study generalised Ramsey numbers for two sets Γ1 and Γ2 of cycles. LÄS MER

5. 4. Formalizing Univalent Set-Level Structures in Cubical Agda

   Författare :Max Zeuner; Anders Mörtberg; Martin Escardo; Stockholms universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES;

   Sammanfattning : This licentiate thesis consists of two papers on formalization projects using Cubical Agda, a rather new extension of the Agda proof assistant with constructive support for univalence and higher inductive types. The common denominator of the two papers is that they are concerned with structures on types that are sets in the sense of Homotopy Type Theory or Univalent Foundations (HoTT/UF). LÄS MER

7. 5. Boolean complexes of involutions and smooth intervals in Coxeter groups

   Författare :Vincent Umutabazi; Axel Hultman; Jan Snellman; Christian Stump; Linköpings universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES;

   Sammanfattning : This dissertation is composed of four papers in algebraic combinatorics related to Coxeter groups. By a Coxeter group, we mean a group W generated by a subset S ⊂ W such that for all s ∈ S , we have s2 = e, and (s, s′)m(s,s′) = (s′ s)m(s,s′) = e, where m(s, s′) = m(s′ s) ≥ 2 for all s ≠ s′ ≥ ∈ S . LÄS MER