Sökning: "type"

Visar resultat 16 - 20 av 11074 avhandlingar innehållade ordet type.

1. 16. Congenital Heart Disease, Type 1 and Type 2 Diabetes Mellitus

   Författare :Anna Björk; Göteborgs universitet; []
   Nyckelord :MEDICIN OCH HÄLSOVETENSKAP; MEDICAL AND HEALTH SCIENCES; Congenital Heart Disease; Diabetes Mellitus; Type 1 Diabetes Mellitus; Type 2 Diabetes Mellitus; Mortality; Morbidity;

   Sammanfattning : Worldwide, 1% of all live born children are born with a congenital heart disease (CHD) and currently >95% reach adulthood due to better diagnostics and medical care. At the same time, Diabetes Mellitus (DM), type 1 (T1DM) and type 2 (T2DM), is increasing worldwide. LÄS MER

3. 17. Ramsey's Theorem in type theory

   Författare :Daniel Fridlender; Chalmers tekniska högskola; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Ramsey s theorem; HIgman s lemma; type theory;

   Sammanfattning : .... LÄS MER

4. 18. Type Theory with First-Order Data Types and Size-Change Termination

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

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

5. 19. Relations in Dependent Type Theory

   Författare :Carlos Gonzalía; Göteborgs universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; formalized mathematics; relational systems; category theory; programming logics; constructive type theory; logical frameworks; relational database model;

   Sammanfattning : This thesis investigates how to express and reason about relational concepts and methods inside the constructive logical framework of Martin-Löf's monomorphic type theory. We cover several areas where the notion of relation is central, and show how to formalize the basic concepts of each area. LÄS MER

7. 20. Practical Unification for Dependent Type Checking

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

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