Avancerad sökning
Visar resultat 21 - 25 av 393 avhandlingar som matchar ovanstående sökkriterier.
21. The roles of inner nuclear membrane proteins during interphase and mitosis
Sammanfattning : The nuclear envelope (NE) consists of two concentric membranes, the outer nuclear membrane (ONM) and the inner nuclear membrane (INM). The LINC (linker of nucleoskeleton and cytoskeleton) complex spans both the ONM and the INM connecting the cytoskeleton to the nucleoskeleton and chromatin. LÄS MER
22. Population fluctuations and life history consequences in the arctic fox
Sammanfattning : In this thesis, I describe and explain drastic population fluctuations in the arctic fox Alopex lagopus (L.). I proceed to examine evolutionary consequences of unpredictable fluctuations in terms of life history strategies. In fluctuating populations, the risks and benefits of different behaviours vary with changes in population density. LÄS MER
23. Functional Polytypic Programming
Sammanfattning : Many algorithms have to be implemented over and over again for different datatypes, either because datatypes change during the development of programs, or because the same algorithm is used for several datatypes. Examples of such algorithms are equality tests, pretty printers, and pattern matchers, and polytypic programming is a paradigm for expressing such algorithms. LÄS MER
24. Univalent Types, Sets and Multisets : Investigations in dependent type theory
Sammanfattning : This thesis consists of four papers on type theory and a formalisation of certain results from the two first papers in the Agda language. We cover topics such as models of multisets and sets in Homotopy Type Theory, and explore ideas of using type theory as a language for databases and different ways of expressing dependencies between terms. LÄS MER
25. Types for Crash Preventionn
Sammanfattning : This thesis seeks to strengthen the capabilities of static polymorphic type-checking (as known from typed lambda calculus and functional programming) to allow a larger class of programming errors to be caught at compile time: the goal is to not only prevent illegal uses of data, but to also errors that lead to busy-loops, deadlocks, stack-overflows and heap-overflows. The thesis exploits that, for recursive programs, many correctness properties (including freedom from errors leading to busy-loops, etc. LÄS MER