| 1. |
-
- 2019
-
Tidskriftsartikel (refereegranskat)
|
|
| 2. |
|
|
| 3. |
- Bernardy, Jean-Philippe, 1978, et al.
(författare)
-
Parametricity and Dependent Types
- 2010
-
Ingår i: SIGPLAN Notices (ACM Special Interest Group on Programming Languages). - : Association for Computing Machinery (ACM). - 0730-8566 .- 0362-1340 .- 1558-1160. ; 45:9, s. 345-356
-
Tidskriftsartikel (refereegranskat)abstract
- Reynolds' abstraction theorem shows how a typing judgement in System F can be translated into a relational statement (in second order predicate logic) about inhabitants of the type. We (in second order predicate logic) about inhabitants of the type. We obtain a similar result for a single lambda calculus (a pure type system), in which terms, types and their relations are expressed. Working within a single system dispenses with the need for an interpretation layer, allowing for an unusually simple presentation. While the unification puts some constraints on the type system (which we spell out), the result applies to many interesting cases, including dependently-typed ones.
|
|
| 4. |
- Bernardy, Jean-Philippe, 1978, et al.
(författare)
-
Parametricity and dependent types
- 2010
-
Ingår i: International Conference on Functional Programming, September 27-29, 2010, Baltimore, Maryland.
-
Konferensbidrag (refereegranskat)abstract
- Reynolds' abstraction theorem shows how a typingjudgement in System F can be translated into a relational statement (in second order predicate logic)about inhabitants of the type. We expose a similar result, whereterms, types, and their relations are expressed in a single typed lambda calculus (a pure type system).Working within a single system dispenses the need for aninterpretation layer, allowing for an unusually simplepresentation. While the unification puts some constraints on the type system(which we spell out), the result applies to many interesting cases, includingdependently-typed ones.
|
|
| 5. |
- Bernardy, Jean-Philippe, 1978, et al.
(författare)
-
Proofs for Free - Parametricity for dependent types
- 2012
-
Ingår i: Journal of Functional Programming. - 1469-7653 .- 0956-7968. ; 22:2, s. 107-152
-
Tidskriftsartikel (refereegranskat)abstract
- Reynolds' abstraction theorem shows how a typing judgement in System F can be translated into a relational statement (in second order predicate logic) about inhabitants of the type.We obtain a similar result for pure type systems: for any PTS used as a programming language, there is a PTS that can be used as a logic for parametricity. Types in the source PTS are translated to relations (expressed as types) in the target. Similarly, values of a given type are translated to proofs that the values satisfy the relational interpretation. We extend the result to inductive families.We also show that the assumption that every term satisfies the parametricity condition generated by its type is consistent with the generated logic. Our proof gives a computationally meaningful way to interpret that assumption.
|
|
| 6. |
- Hallqvist, Jenny, et al.
(författare)
-
A Multiplexed Urinary Biomarker Panel Has Potential for Alzheimer's Disease Diagnosis Using Targeted Proteomics and Machine Learning
- 2023
-
Ingår i: INTERNATIONAL JOURNAL OF MOLECULAR SCIENCES. - 1661-6596 .- 1422-0067. ; 24:18
-
Tidskriftsartikel (refereegranskat)abstract
- As disease-modifying therapies are now available for Alzheimer's disease (AD), accessible, accurate and affordable biomarkers to support diagnosis are urgently needed. We sought to develop a mass spectrometry-based urine test as a high-throughput screening tool for diagnosing AD. We collected urine from a discovery cohort (n = 11) of well-characterised individuals with AD (n = 6) and their asymptomatic, CSF biomarker-negative study partners (n = 5) and used untargeted proteomics for biomarker discovery. Protein biomarkers identified were taken forward to develop a high-throughput, multiplexed and targeted proteomic assay which was tested on an independent cohort (n = 21). The panel of proteins identified are known to be involved in AD pathogenesis. In comparing AD and controls, a panel of proteins including MIEN1, TNFB, VCAM1, REG1B and ABCA7 had a classification accuracy of 86%. These proteins have been previously implicated in AD pathogenesis. This suggests that urine-targeted mass spectrometry has potential utility as a diagnostic screening tool in AD.
|
|
| 7. |
- Hillier, Ladeana W, et al.
(författare)
-
Sequence and comparative analysis of the chicken genome provide unique perspectives on vertebrate evolution
- 2004
-
Ingår i: Nature. - 0028-0836 .- 1476-4687. ; 432:7018, s. 695-716
-
Tidskriftsartikel (refereegranskat)abstract
- We present here a draft genome sequence of the red jungle fowl, Gallus gallus. Because the chicken is a modern descendant of the dinosaurs and the first non-mammalian amniote to have its genome sequenced, the draft sequence of its genome--composed of approximately one billion base pairs of sequence and an estimated 20,000-23,000 genes--provides a new perspective on vertebrate genome evolution, while also improving the annotation of mammalian genomes. For example, the evolutionary distance between chicken and human provides high specificity in detecting functional elements, both non-coding and coding. Notably, many conserved non-coding sequences are far from genes and cannot be assigned to defined functional classes. In coding regions the evolutionary dynamics of protein domains and orthologous groups illustrate processes that distinguish the lineages leading to birds and mammals. The distinctive properties of avian microchromosomes, together with the inferred patterns of conserved synteny, provide additional insights into vertebrate chromosome architecture.
|
|
