Дисертації з теми "Inductive types"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся з топ-50 дисертацій для дослідження на тему "Inductive types".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Переглядайте дисертації для різних дисциплін та оформлюйте правильно вашу бібліографію.
Bruin, Peter Johan de. "Inductive types in constructive languages." [S.l. : [Groningen] : s.n.] ; [University Library Groningen] [Host], 1995. http://irs.ub.rug.nl/ppn/128570415.
Повний текст джерелаGrimley, Allan. "Inductive types in functional programming." Thesis, University of Kent, 1990. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.253737.
Повний текст джерелаKaposi, Ambrus. "Type theory in a type theory with quotient inductive types." Thesis, University of Nottingham, 2017. http://eprints.nottingham.ac.uk/41385/.
Повний текст джерелаAltenkirch, Thorsten. "Constructions, inductive types and strong normalization." Thesis, University of Edinburgh, 1993. http://hdl.handle.net/1842/11967.
Повний текст джерелаPavaux, Alice. "Inductive, Functional and Non-Linear Types in Ludics." Thesis, Sorbonne Paris Cité, 2017. http://www.theses.fr/2017USPCD092.
Повний текст джерелаThis thesis investigates the types of ludics. Within the context of the Curry–Howard correspondence,l udics is a framework in which the dynamic aspects of both logic and programming can be studied. The basic objects, called designs, are untyped infinitary proofs that can also beseen as strategies from the perspective of game semantics, and a type or behaviour is a set of designs well-behaved with respect to interaction. We are interested in observing the interactive properties of behaviours. Our attention is particularly focused on behaviours representing the types of data and functions, and on non-linear behaviours which allow the duplication of objects. A new internal completeness result for infinite unions unveils the structure of inductive data types. Thanks to an analysis of the visitable paths, i.e., the possible execution traces, we prove that inductive and functional behaviours are regular, paving the way for a characterisation of MALL in ludics. We also show that a functional behaviour is pure, a property ensuring the safety of typing, if and only if it is not a type of functions taking functions as argument. Finally,we set the bases for a precise study of non-linearity in ludics by recovering a form of internal completeness and discussing the visitable paths
Ko, Hsiang-Shang. "Analysis and synthesis of inductive families." Thesis, University of Oxford, 2014. http://ora.ox.ac.uk/objects/uuid:2bc39bde-ce59-4a49-b499-3afdf174bbab.
Повний текст джерелаDiehl, Larry. "Fully Generic Programming Over Closed Universes of Inductive-Recursive Types." PDXScholar, 2017. https://pdxscholar.library.pdx.edu/open_access_etds/3647.
Повний текст джерелаCiaffaglione, Alberto. "Certified reasoning on real numbers and objects in co-inductive type theory." Vandoeuvre-les-Nancy, INPL, 2003. http://docnum.univ-lorraine.fr/public/INPL_T_2003_CIAFFAGLIONE_A.pdf.
Повний текст джерелаWe adopt Formal Methods based on Type Theory for reasoning on the semantics of computer programs: the ultimate goal is to prove that a fragment of software meets its formal specification. Application areas of our research are the Real Numbers datatype and the Object-oriented Languages based on Objects. In the first part we construct the Real Numbers using streams, i. E. Infinite sequences, of signed digits. We implement the Reals in Coq using streams, which are managed using coinductive judgments and corecursive algorithms. Then we introduce a constructive axiomatization and we use it for proving the adequacy of our construction. In the second part we approach Object-based Calculi with side-effects, focusing on Abadi and Cardelli's imp[sigma]. We reformulate imp[sigma] using modern encoding techniques, as Higher-Order Abstract Syntax and Coinductive proof systems in Natural Deduction style. Then we formalize imp[sigma] in Coq and we prove the Type Soundness
Giorgino, Mathieu. "Inductive representation, proofs and refinement of pointer structures." Toulouse 3, 2013. http://thesesups.ups-tlse.fr/2076/.
Повний текст джерелаThis thesis stands in the general domain of formal methods that gives semantics to programs to formally prove properties about them. It originally draws its motivation from the need for certification of systems in an industrial context where Model Driven Engineering (MDE) and object-oriented (OO) languages are common. In order to obtain efficient transformations on models (graphs), we can represent them as pointer structures, allowing space and time savings through the sharing of nodes. However verification of properties on programs manipulating pointer structures is still hard. To ease this task, we propose to start the development with a high-level implementation embodied by functional programs manipulating inductive data-structures, that are easily verified in proof assistants such as Isabelle/HOL. Pointer structures are represented by a spanning tree adorned with additional references. These functional programs are then refined - if necessary - to imperative programs thanks to the library Imperative_HOL. These programs are finally extracted to Scala code (OO). This thesis describes this kind of representation and refinement and provides tools to manipulate and prove OO programs in Isabelle/HOL. This approach is put in practice with several examples, and especially with the Schorr-Waite algorithm and the construction of Binary Decision Diagrams (BDDs)
Arkoudas, Kostas. "On the termination of recursive algorithms in pure first-order functional languages with monomorphic inductive data types." Thesis, Massachusetts Institute of Technology, 1996. http://hdl.handle.net/1721.1/39074.
Повний текст джерелаSattler, Christian. "On the complexities of polymorphic stream equation systems, isomorphism of finitary inductive types, and higher homotopies in univalent universes." Thesis, University of Nottingham, 2015. http://eprints.nottingham.ac.uk/28111/.
Повний текст джерелаForstbach, Fredrik D. "Branding green cars by the use of ecobrands an inductive study into different types of ecobrands and how they can be used for branding green cars /." St. Gallen, 2008. http://www.biblio.unisg.ch/org/biblio/edoc.nsf/wwwDisplayIdentifier/03605912001/$FILE/03605912001.pdf.
Повний текст джерелаKUSAKARI, Keiichirou, Masahiko SAKAI, and Toshiki SAKABE. "Primitive Inductive Theorems Bridge Implicit Induction Methods and Inductive Theorems in Higher-Order Rewriting." IEICE, 2005. http://hdl.handle.net/2237/9580.
Повний текст джерелаChemouil, David. "Types inductifs, isomorphismes et récriture extensionnelle." Toulouse 3, 2004. http://www.theses.fr/2004TOU30187.
Повний текст джерелаThis PhD thesis copes with extensions of the simply-typed lambda-calculus by various rewrite relations preserving termination and confluence. Our first purpose is to ensure that some types become isomorphic. As far as inductive types are concerned, this problem is undecidable: therefore, we added some particular reductions solving it only in peculiar cases, namely the inductive encoding of the product and unit types and, more importantly, the notion of parameterised copy. Next, leaving isomorphims, we consider new reductions enabling to set up some algebraic structures on finite types: firstly, we deal with the definition of a category on a fragment of the calculus; and, secondly, with the representation of the symmetric group by factorisation of permutations as products of disjoint cycles. These results are obtained using techniques from abstract rewriting theory, some of which we have specifically developped for this thesis
Paulin-Mohring, Christine. "Définitions Inductives en Théorie des Types." Habilitation à diriger des recherches, Université Claude Bernard - Lyon I, 1996. http://tel.archives-ouvertes.fr/tel-00431817.
Повний текст джерелаTorres, Padilla Juan Pablo. "Inductive Program Synthesis with a Type System." Thesis, Uppsala universitet, Informationssystem, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-385282.
Повний текст джерелаCHIBA, Yuki, and Keiichirou KUSAKARI. "A Higher-Order Knuth-Bendix Procedure and Its Applications." Institute of Electronics, Information and Communication Engineers, 2007. http://hdl.handle.net/2237/14974.
Повний текст джерелаWand, Daniel [Verfasser], and Christoph [Akademischer Betreuer] Weidenbach. "Superposition: Types and Induction / Daniel Wand ; Betreuer: Christoph Weidenbach." Saarbrücken : Saarländische Universitäts- und Landesbibliothek, 2017. http://d-nb.info/1140054791/34.
Повний текст джерелаWerner, Benjamin. "Une Théorie des Constructions Inductives." Phd thesis, Université Paris-Diderot - Paris VII, 1994. http://tel.archives-ouvertes.fr/tel-00196524.
Повний текст джерелаDans le Calcul des Constructions originel, les types de données (entiers, listes, sommes, etc) sont représentés dans le lambda-calcul à travers un codage imprédicatif. Cette solution est élégante mais conduit à un certain nombre de difficultés pratiques et théoriques. Pour y remédier, Thierry Coquand et Christine Paulin-Mohring on proposé d'étendre le formalisme par un mécanisme génerique de définitions inductives. C'est cette extension, utilisée dans le système Coq, qui est étudiée dans cette thèse. Le résultat essentiel est que le système vérifie bien la proprieté de normalisation forte. On en déduit les proprietés de cohérence logique, de confluence et de décidabilité du typage.
L'aspect le plus spectaculaire de l'extension par des types inductifs est la possibilité de définir de nouveaux types et de nouvelles propositions par récurrence structurelle (élimination forte). Cette caractéristique, qui donne toute sa signification à la notion de types dépendants, augmente énormément le pouvoir de la règle de conversion, et par là, la difficulté de la preuve de normalisation. L'interprétation de l'élimination forte dans une preuve de normalisation par réductibilité est la nouveauté essentielle de ce travail.
De plus, nous considérons ici un système avec eta-conversion. Une conséquence est que la propriété de confluence n'est plus combinatoire et doit être prouvée après la normalisation, ce qui augmente à nouveau la difficulté de la preuve de celle-ci. A ce titre, nous présentons également quelques résultats nouveaux sur des systèmes non-normalisants qui montrent que pour des lambda-calculs typés, la propriété de confluence est logique et non combinatoire.
Terrasse, Delphine. "Vers un environnement d’aide au développement de preuves en sémantique naturelle." Marne-la-Vallée, ENPC, 1995. http://www.theses.fr/1995ENPC9537.
Повний текст джерелаAlvarado, Cuihtlauac. "Réflexion pour la réécriture dans le calcul des constructions inductives." Paris 11, 2002. http://www.theses.fr/2002PA112305.
Повний текст джерелаThis thesis presents a generic method to use a technique called computational reflection in the Calculus of Inductive Constructions (CIC) in order to improve efficiency of term rewriting reasonings in the first-order, multi-sorted fragment. The Coq System is a proof assistant based on CIC. It is an interactive system where a user can proof theorems or verify program. The CIC is a constructive and higher-order logic based on type theory. In this logic, theorem claims are types and proofs are objects inhabiting types to be proved. In Coq, proof-checking reduces to type-checking. For equational reasoning, type-checking make arise performances issues. Equal terms replacements are performed by a function taking as arguments all the logical information needed to justify logically this replacement, then it produces a new proof as a result. A proof build by rewriting contains a full copy of the theorem under demonstration. Those copies are specially problematic for automatic reasoning procedures. They are often perform numerous inferences. Those computations are likely to generate large size proof terms. Checking those proof terms is no longer tractable. We studied computational reflection to address this problem. Using computational reflection an automatic reasoning procedure can be introduced inside a Coq proof term. This procedure must be certified in the CIC, in the formal method sense : proven. To implement computational reflection one must express the decisions procedures and their correctness proofs in the object language of the proof assistant. Correctness is express as a semantics interpretation preservation property of the procedure's data. The Conversion rule of the CIC is essential for the computational reflexion to have some benefit, it allows to introduce chosen computations during proof checking. In the two firsts chapters we recall term rewriting and the Calculus of Inductive Constructions. In the two following chapters we present status of equality in the Calculus of Inductive Constructions and computational reflexion. Finally we present our implementation of computational reflexion for term rewriting
Oury, Nicolas. "Egalité et filtrage avec types dépendants dans le calcul des constructions inductives." Paris 11, 2006. http://www.theses.fr/2006PA112136.
Повний текст джерелаType Theory allows the use of dependent types. Types can depend upon values of the system. It is possible, for example, to define the set of lists of a given size n. Some types are equivalent and syntactically different. For example, lists of size 2+2 are the same objects as list of size 4. The conversion process of the system checks for these equivalencies. In the Calculus of Inductive Constructions, this process is reduced to a small set of elementary rules of calculus. For example, lists of size n+0 and lists of size n are distinct types. We introduce an extensional system : in such a system, every provable equality is added to the conversion. We exhibit a translation from this system to a slight extension of the Calculus of Inductive Constructions. This process can be used both as a theorical justification and a practical basis for the implementation of such a system. In the presence of dependent types, some cases can be useless in a definition by pattern matching. For example, the case of the empty list in a function taking lists of non zero size as argument is useless. We introduce a method to eliminate some useless cases in a pattern matching with dependent types. This method relies on approximations of the set of terms inhabiting a type or a context. It is parametred by the approximation used to represent such sets. We show the correction of this method and we introduce to implementations of set approximation that can be used in practice
Sacchini, Jorge. "Terminaison basée sur les types et filtrage dépendant pour le calcul des constructions inductives." Phd thesis, École Nationale Supérieure des Mines de Paris, 2011. http://pastel.archives-ouvertes.fr/pastel-00622429.
Повний текст джерелаStrub, Pierre-Yves. "Théorie des Types et Procédures de Décision." Phd thesis, Ecole Polytechnique X, 2008. http://tel.archives-ouvertes.fr/tel-00351837.
Повний текст джерелаNotre principal apport est la définition et l'étude du Calcul des Constructions Inductives Congruentes, une extension du Calcul des Constructions Inductives (CIC), intégrant au sein de son mécanisme de calcul des procédures de décisions pour des théories equationnelles au premier ordre.
Nous montrons que ce calcul possède toutes les propriétés attendues: confluence, normalisation forte, cohérence logique et décidabilité de la vérification de types sont préservées. En tant que tel, notre calcul peut être vu comme une restriction décidable du Calcul des Constructions Extentionnelles et peut servir comme base pour l'extension de l'assistant à la preuve Coq.
Corbineau, Pierre. "Démonstration automatique en théorie des types." Paris 11, 2005. http://www.theses.fr/2005PA112149.
Повний текст джерелаAmong software designed to help formal reasoning, there are automated theorem provers and interactive proof assistants. The former are specialized tools using technics that differ from traditionnal reasoning methods, but they have a very limited range. The latter have a wider range but theii users must specify explicitly every proof step. Automation of proofs is tricky in these latter tools because they use expressive logical systems. This thesis is build around three contributions in this field. First, we present an extension of congruence-closure the a theory of constructors with partial application. An algorithm to solve this problem is described and studied. Then, we build a first-order formalism including connectives defined as non-recursive inductive types similar to those in the Calculus of Inductive Constructions. We present a new contraction-free sequent calculus for first-order intuitionistic logic that is adapted to this formalism, and we prove its fundamental properties: contraction- and cut-elimination. We derive a semi-decision procedure from these results. Those two contributions are implemented inside the Coq proof assistant; the third one is the description of a methode allowing the interpretation of first-order proof tree into Type Theory by computational reflection. This paradigm is applied to propositionnal logic and is used by a decision procedure inside the Coq system. This method is also adapted to first-order logic with equality and allows to check proofs obtained by ordered completion in the CiME system
Hidmark, Åsa. "Induction of type I interferons and viral immunity /." Stockholm, 2007. http://diss.kib.ki.se/2007/978-91-7357-227-9/.
Повний текст джерелаLeeuwen, Ester Marga Maria van. "Induction and maintenance of human virus-specific T cells." [S.l. : Amsterdam : s.n.] ; Universiteit van Amsterdam [Host], 2005. http://dare.uva.nl/document/78986.
Повний текст джерелаSacchini, Jorge Luis. "On type-based termination and dependent pattern matching in the calculus of inductive constructions." Institut national de recherche en informatique et en automatique (France). Unité de recherche (Sophia Antipolis, Alpes-Maritimes), 2011. http://pastel.archives-ouvertes.fr/pastel-00622429.
Повний текст джерелаProof assistants based on dependent type theory are gaining adoption as a tool to develop certified programs. A successful example is the Coq proof assistant, an implementation of a dependent type theory called the Calculus of Inductive Constructions (CIC). Coq is a functional programming language with an expressive type system that allows to specify and prove properties of programs in a higher-order predicate logic. Motivated by the success of Coq and the desire of improving its usability, in this thesis we study some limitations of current implementations of Coq and its underlying theory, CIC. We propose two extension of CIC that partially overcome these limitations and serve as a theoretical basis for future implementations of Coq. First, we study the problem of termination of recursive functions. In Coq, all recursive functions must be terminating, in order to ensure the consistency of the underlying logic. Current techniques for checking termination are based on syntactical criteria and their limitations appear often in practice. We propose an extension of CIC using a type-based mechanism for ensuring termination of recursive functions. Our main contribution is a proof of Strong Normalization and Logical Consistency for this extension. Second, we study pattern-matching definitions in CIC. With dependent types it is possible to write more precise and safer definitions by pattern matching than with traditional functional programming languages such as Haskell and ML. Based on the success of dependently-typed programming languages such as Epigram and Agda, we develop an extension of CIC with similar features
Lee, Yoong Keok. "Context-dependent type-level models for unsupervised morpho-syntactic induction." Thesis, Massachusetts Institute of Technology, 2015. http://hdl.handle.net/1721.1/97759.
Повний текст джерелаThis electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Cataloged from student-submitted PDF version of thesis.
Includes bibliographical references (pages 126-141).
This thesis improves unsupervised methods for part-of-speech (POS) induction and morphological word segmentation by modeling linguistic phenomena previously not used. For both tasks, we realize these linguistic intuitions with Bayesian generative models that first create a latent lexicon before generating unannotated tokens in the input corpus. Our POS induction model explicitly incorporates properties of POS tags at the type-level which is not parameterized by existing token-based approaches. This enables our model to outperform previous approaches on a range of languages that exhibit substantial syntactic variation. In our morphological segmentation model, we exploit the fact that axes are correlated within a word and between adjacent words. We surpass previous unsupervised segmentation systems on the Modern Standard Arabic Treebank data set. Finally, we showcase the utility of our unsupervised segmentation model for machine translation of the Levantine dialectal Arabic for which there is no known segmenter. We demonstrate that our segmenter outperforms supervised and knowledge-based alternatives.
by Yoong Keok Lee.
Ph. D.
Liu, Yi. "Negative Regulation of Type I Interferon Induction in Dendritic Cells." Case Western Reserve University School of Graduate Studies / OhioLINK, 2011. http://rave.ohiolink.edu/etdc/view?acc_num=case1310149509.
Повний текст джерелаAnagandula, Mahesh. "Studies of Enterovirus Infection and Induction of Innate Immunity in Human Pancreatic Cells." Doctoral thesis, Uppsala universitet, Klinisk immunologi, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-284370.
Повний текст джерелаAlinejad, Yasaman. "Effect of different carbon black types on single-walled carbon nanotube production by induction thermal plasma." Mémoire, Université de Sherbrooke, 2008. http://savoirs.usherbrooke.ca/handle/11143/1542.
Повний текст джерелаAlbesa, Querol Joan. "Monitoring switch-type sensors and powering autonomous sensors via inductive coupling: application to removable seats in vehicles." Doctoral thesis, Universitat Politècnica de Catalunya, 2012. http://hdl.handle.net/10803/101400.
Повний текст джерелаAlgunes aplicacions a l'entorn de l'automòbil no són possibles si no és mitjançant la connexió sense fils dels seus dispositius a causa que el cablejat és difícil o inviable. Alguns exemples els trobem en el monitoratge de sensors situats en parts rotatòries, com les rodes, o en elements extraïbles, com els seients. Els sistemes de monitoratge de la pressió de l'aire en les rodes (TPMS) són d'obligat compliment als EUA i ho seran en breu també als països membres de la UE per als vehicles de categories M1 o N1 aprovats a partir de l'1 de novembre de 2012 o per als vehicles matriculats a partir de l'1 de novembre de 2014. Actualment, els sistemes TPMS existents al mercat estan alimentats per piles. Amb tot, la vida útil exigida per a les bateries és d'uns 10 anys, esdevenint el seu ús un autèntic repte. Un altre element en contra de l'ús de bateries és la directiva 2006/66/CE que limita el nombre màxim permès en els vehicles. D'altra banda, moltes furgonetes o mini furgonetes i vehicles familiars incorporen seients extraïbles amb l'objectiu d'aprofitar al màxim l'espai interior. Alguns models comercials incorporen en el seient extraïble el detector de cinturó de seguretat. Per evitar el cablejat, existeixen sistemes de detecció passiva mitjançant acoblament inductiu. A partir del present any 2012, una regulació de la agència nord-americana NHTSA requereix de l'ús de coixins de seguretat intel·ligents per minimitzar els riscos en nens. Aquests seients intel·ligents haurien de detectar si el passatger és un adult, una cadira infantil o si està lliure per evitar problemes ocorreguts en anterioritat amb els sistemes coixí de seguretat. Els sensors usats per a aquests coixins de seguretat intel·ligents requeririen d'energia per operar. Una opció per als seients extraïbles és la transmissió de potència via acoblament inductiu des del terra del xassís del vehicle fins al seient. També és possible usar l'acoblament inductiu per detectar l'estat de diversos sensors existents en els seients extraïbles mitjançant detecció passiva. Precisament, la detecció d'ocupació i de cinturó de seguretat en seients extraïbles ha estat seleccionada per aplicar la investigació present que consisteix, d'una banda, en el monitoratge de sensors de tipus commutat (dos possibles estats) via acoblament inductiu i, per una altra, en la transmissió mitjançant el mateix principi físic de la potència necessària per alimentar els sensors autònoms remots. En els dos casos, una primera bobina es fixaria en el seient extraïble, connectada als sensors, i una segona bobina se situaria sota la primera, en el terra del vehicle.
Park, Benjamin Alan. "Inductively coupled plasma induced type conversion of HgCdTe for infrared photodiode applications." University of Western Australia. School of Electrical, Electronic and Computer Engineering, 2009. http://theses.library.uwa.edu.au/adt-WU2010.0003.
Повний текст джерелаParish, Joanna L. "The induction of apoptosis by the human papillomavirus type 16 E2 protein." Thesis, University of Bristol, 2001. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.391157.
Повний текст джерелаWiens, Kirsten E. "Type I Interferon Induction by Diverse Strains of the Mycobacterium Tuberculosis Complex." Thesis, New York University, 2017. http://pqdtopen.proquest.com/#viewpdf?dispub=10249580.
Повний текст джерелаBacterial strains from the Mycobacterium tuberculosis complex (MTBC) are functionally diverse and vary in both geographic distribution and potential to cause tuberculosis (TB) disease. Mycobacterium africanum —a lineage of the MTBC—is restricted to West Africa and causes slower progression to active tuberculosis (TB) after initial infection than other MTBC lineages. We hypothesized that this may be partly due to how bacterial strains from these lineages interact with the host immune response. Specifically, we predicted that M. africanum would induce less of the innate cytokine type I interferon because type I interferon has been shown to contribute to TB disease. Our studies focused on (1) whether diverse MTBC strains induce distinct levels of type I interferon in host cells, (2) the mechanism underlying differential type I interferon induction by diverse MTBC strains, and (3) the consequences of the type I interferon response during infection with diverse MTBC strains. We found that M. africanum induced less mitochondrial stress, less release of mitochondrial DNA and less cGAS- and STING-dependent type I interferon in macrophages than other M. tuberculosis strains. Furthermore, we found that M. africanum contained a polymorphism in the Esx-1 gene locus and was unable to secrete the virulence factor EspB through the Esx-1 secretion system, which may contribute to the reduced type I interferon induction by this strain. Finally, we found that type I interferon signaling was pathogenic during chronic M. africanum infection in mice, and thus that the ability to induce pathogenic levels of type I interferon is likely widespread in MTBC strains. Our data suggest that reduced mitochondrial stress and reduced type I interferon induction may contribute to the attenuation of M. africanum. Moreover, our data show that treatments that limit type I interferon induction could be effective in treating diverse mycobacterial infections. Therefore our studies provide insight into a mycobacterial virulence mechanism and highlight the importance of studying diverse clinical isolates of M. tuberculosis.
Carrier, Émilie. "Mécanismes anti-plaquettaires endogènes distincts chez les souris de type sauvage ou athérosclérosées." Thèse, Université de Sherbrooke, 2009. http://savoirs.usherbrooke.ca/handle/11143/4272.
Повний текст джерелаBaroukh, Maya Brigitte. "L'activation de la resorption osteoclastique : differences entre une situation pathologique de type inflammatoire et une induction de type mecanique." Paris 5, 1998. http://www.theses.fr/1998PA05M097.
Повний текст джерелаRedha, Amina. "Induction and analysis of chromosome doubling of microspore derived wheat haploids /." Zürich, 1998. http://e-collection.ethbib.ethz.ch/show?type=diss&nr=12855.
Повний текст джерелаBerg, Anna-Karin. "Enterovirus Infections of β-Cells : A Mechanism of Induction of Type 1 Diabetes?" Doctoral thesis, Uppsala University, Department of Women's and Children's Health, 2005. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-6019.
Повний текст джерелаThe process of β-cell destruction that leads to type 1 diabetes (T1D) is incompletely understood and it is believed to be a result of both genetic and environmental factors. Enterovirus (EV) infections of the β-cells have been proposed to be involved, however, the effects of EV infections on human β-cells have been little investigated. This thesis summarises studies of three different Coxsackie B4 virus strains that have previously been shown to infect human islets. The effects of infections with these EV were studied in vitro in human islets and in a rat insulin-producing cell line. In addition, a pilot study was performed on isolated human islets to investigate the ability to treat such infections with an antiviral compound.
It was found that one of the virus strains replicated in human β-cells without affecting their main function for at least seven days, which in vivo may increase a virus’s ability to persist in islets.
Nitric oxide was induced by synthetic dsRNA, poly(IC), but not by viral dsRNA in rat insulinoma cells in the presence of IFN-γ, suggesting that this mediator is not induced by EV infection in β-cells and that poly(IC) does not mimic an EV infection in this respect.
All three virus strains were able to induce production of the T-cell chemoattractant interferon-γ-inducible protein 10 (IP-10) during infection of human islets, suggesting that an EV infection of the islets might trigger insulitis in vivo.
Antiviral treatment was feasible in human islets, but one strain was resistant to the antiviral compound used in this study.
To conclude, a potential mechanism is suggested for the involvement of EV infections in T1D. If EV infections induce IP-10 production in human islet cells in vivo, they might recruit immune cells to the islets. Together with viral persistence and/or virus-induced β-cell damage, this might trigger further immune-mediated β-cell destruction in vivo.
Pokrishevsky, Edward. "Induction of wild-type SOD1 misfolding, aggregation and its cell-to-cell propagation." Thesis, University of British Columbia, 2017. http://hdl.handle.net/2429/61079.
Повний текст джерелаMedicine, Faculty of
Experimental Medicine, Division of
Medicine, Department of
Graduate
Li, Li. "Induction and regulation of delayed type hypersensitivity by CD4 and CD8 T subsets." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1997. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp04/nq23017.pdf.
Повний текст джерелаGoto, Masahisa. "Growth-Dependent Induction of Angiotensin II Type 2 Receptor in Rat Mesangial Cells." Kyoto University, 2001. http://hdl.handle.net/2433/150550.
Повний текст джерелаSpadotti, Régis. "Une théorie mécanisée des arbres réguliers en théorie des types dépendants." Thesis, Toulouse 3, 2016. http://www.theses.fr/2016TOU30178/document.
Повний текст джерелаWe propose two characterizations of regular trees. The first one is semantic and is based on coinductive types. The second one is syntactic and represents regular trees by means of cyclic terms. We prove that both of these characterizations are isomorphic. Then, we study the problem of defining tree morphisms preserving the regularity property. We show, by using the formalism of tree transducers, the existence of syntactic criterion ensuring that this property is preserved. Finally, we consider applications of the theory of regular trees such as the definition of the parallel composition operator of a process algebra or, the decidability problems on regular trees through a mechanization of a model-checker for a coalgebraic mu-calculus. All the results were mechanized and proved correct in the Coq proof assistant
Hyland, Paula Lisa. "Sequence analysis of the adenine phosphoribosyltransferase gene locus in wild-type and thymidine kinase-deficient friend erythroleukaemia cells." Thesis, University of Ulster, 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.390158.
Повний текст джерелаMosbach, Valentine. "Contraction de répétitions de trinucléotides par induction ciblée d'une cassure double brin." Thesis, Paris 6, 2017. http://www.theses.fr/2017PA066040.
Повний текст джерелаTrinucleotides repeats are a specific class of microsatellites whose large expansions are responsible for many human neurological disorders. Myotonic dystrophy type 1 (DM1) is due to an expansion of CTG repeats in the 3’UTR of DMPK gene, which can reach thousands of repeats. Molecular mechanisms leading to these large expansions are poorly understood but in vitro studies have shown the capacity of these repeats to form secondary structures, which probably interfere with mechanisms involving DNA synthesis. We shown that a TALEN used to induce double-strand break (DSB) in DM1 CTG repeats integrated in the yeast Saccharomyces cerevisiae is specific and leads to highly efficient repeat contractions after repair. Mechanism involved in TALEN-induced DSB only depends of RAD50 and RAD52 genes, suggesting the formation of secondary structures at DSB ends that need to be removed for repair initiation, followed by an intramolecular recombinaison repair such as SSA between repeats leading to their contraction. We compared the efficiency and specificity of a CRISPR-Cas9 and the TALEN to contract CTG repeats in yeast. Surprisingly, CRISPR-Cas9 induction do not lead to repeat contraction but to chromosomal rearrangement, suggesting a lack of specificity and a different repair mechanism than with the TALEN. At last, we studied whether these nucleases could contract CTG repeats to a non-pathological length in mammalian cells. Finally, TALEN induction in DM1 transgenic mice cells, and in DM1 human fibroblasts show promising repeat contractions
Sepa, Anneli. "The Stress Hypothesis : Implications for the induction of diabetes-related autoimmunity in children?" Doctoral thesis, Linköping : Univ, 2004. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-5177.
Повний текст джерелаPaulin-Mohring, Christine. "Extraction de programmes dans le Calcul des Constructions." Phd thesis, Université Paris-Diderot - Paris VII, 1989. http://tel.archives-ouvertes.fr/tel-00431825.
Повний текст джерелаCambouropoulos, Peter. "Studies on the induction and prevention of delayed type hypersensitivity to herpes simplex virus." Thesis, University of Cambridge, 1994. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.336550.
Повний текст джерелаYu, Yueyang. "Induction of Mitotic Alterations by the Human Papillomavirus Type 16 E7 Oncoprotein: Mechanistic Studies." Thesis, Harvard University, 2013. http://dissertations.umi.com/gsas.harvard:11112.
Повний текст джерела