| 1. |
- Bernardy, Jean-Philippe, 1978, et al.
(författare)
-
A comparison of C++ concepts and Haskell type classes
- 2008
-
Ingår i: ACM SIGPLAN Workshop on Generic Programming 2008. Victoria, Canada, 20th September 2008. - 9781605580609 ; , s. 37-48
-
Konferensbidrag (refereegranskat)abstract
- Earlier studies have introduced a list of high-level evaluation criteria to assess how well a language supports generic programming. Since each language that meets all criteria is considered generic, those criteria are not fine-grained enough to differentiate between two languages for generic programming.We refine these criteria into a taxonomy that capturesdifferences between type classes in Haskell and concepts inC++, and discuss which differences are incidental and whichones are due to other language features. The taxonomy allows for an improved understanding of language support for generic programming, and the comparison is useful for the ongoing discussions among language designers and users of both languages.
|
|
| 2. |
- Hellgren, Mikko, 1972-, et al.
(författare)
-
Hypertension management in primary health care : a survey in eight regions of Sweden
- 2023
-
Ingår i: Scandinavian Journal of Primary Health Care. - : Taylor & Francis. - 0281-3432 .- 1502-7724. ; 41:3, s. 343-350
-
Tidskriftsartikel (refereegranskat)abstract
- Purpose: To explore hypertension management in primary healthcare (PHC).Design: Structured interviews of randomly selected PHC centres (PHCCs) from December 2019 to January 2021.Setting: Seventy-six PHCCs in eight regions of Sweden.Main outcome measures: Staffing and organization of hypertension care. Methods of measuring blood pressure (BP), laboratory tests, registration of co-morbidities and lifestyle advice at diagnosis and follow-up.Results: The management of hypertension varied among PHCCs. At diagnosis, most PHCCs (75%) used the sitting position at measurements, and only 13% routinely measured standing BP. One in three (33%) PHCCs never used home BP measurements and 25% only used manual measurements. The frequencies of laboratory analyses at diagnosis were similar in the PHCCs. At follow-up, fewer analyses were performed and the tests of lipids and microalbuminuria decreased from 95% to 45% (p < 0.001) and 61% to 43% (p = 0.001), respectively. Only one out of 76 PHCCs did not measure kidney function at routine follow-ups. Lifestyle, physical activity, food habits, smoking and alcohol use were assessed in & GE;96% of patients at diagnosis. At follow-up, however, there were fewer assessments. Half of the PHCCs reported dedicated teams for hypertension, 82% of which were managed by nurses. There was a great inequality in the number of patients per tenured GP in the PHCCs (median 2500; range 1300-11300) patients.Conclusions: The management of hypertension varies in many respects between PHCCs in Sweden. This might lead to inequity in the care of patients with hypertension.
|
|
| 3. |
- Jansson, Julia, 1999, et al.
(författare)
-
Level-p-complexity of Boolean functions using thinning, memoization, and polynomials
- 2023
-
Ingår i: Journal of Functional Programming. - 1469-7653 .- 0956-7968. ; 33
-
Tidskriftsartikel (refereegranskat)abstract
- This paper describes a purely functional library for computing level-p-complexity of Boolean functions and applies it to two-level iterated majority. Boolean functions are simply functions from n bits to one bit, and they can describe digital circuits, voting systems, etc. An example of a Boolean function is majority, which returns the value that has majority among the n input bits for odd n. The complexity of a Boolean function f measures the cost of evaluating it: how many bits of the input are needed to be certain about the result of f. There are many competing complexity measures, but we focus on level-p-complexity — a function of the probability p that a bit is 1. The level-p-complexity Dp(f)��(�) is the minimum expected cost when the input bits are independent and identically distributed with Bernoulli(p) distribution. We specify the problem as choosing the minimum expected cost of all possible decision trees — which directly translates to a clearly correct, but very inefficient implementation. The library uses thinning and memoization for efficiency and type classes for separation of concerns. The complexity is represented using (sets of) polynomials, and the order relation used for thinning is implemented using polynomial factorization and root counting. Finally, we compute the complexity for two-level iterated majority and improve on an earlier result by J. Jansson.
|
|
| 4. |
- Algehed, Maximilian, 1995, et al.
(författare)
-
Saint: an API-generic type-safe interpreter
- 2019
-
Ingår i: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). - Cham : Springer International Publishing. - 1611-3349 .- 0302-9743. ; 11457 LNCS, s. 94-113
-
Konferensbidrag (refereegranskat)abstract
- Many programs written in the functional programming language Haskell take advantage of its advanced type system. Haskell's type system is very expressive and allows us to write interesting programs without sacrificing type safety. Haskell programs that expose its API to an open world, however, are faced with the problem of dynamic type checking. Existing techniques that address this problem, such as Typeable and Dynamic, are often closed and difficult to extend. We have constructed an extensible library for describing APIs using annotated type representations. As a result, API calls can be interpreted in a type-safe manner without any extra programming effort. In addition, the user has full control over the universe of allowed types, which helps to catch any misconceptions in an early stage. We have applied our technique to connect a real-world DSL (GRACe) to a JavaScript GUI.
|
|
| 5. |
- Algehed, Maximilian, 1995, et al.
(författare)
-
VisPar: Visualising dataflow graphs from the Par monad
- 2017
-
Ingår i: 6th ACM SIGPLAN International Workshop on Functional High-Performance Computing, FHPC 2017, Oxford, United Kingdom, 7 September 2017. - New York, NY, USA : ACM. - 9781450351812 ; , s. 24-29
-
Konferensbidrag (refereegranskat)abstract
- We present a work in progress tool (VisPar) for visualising computations in the Par monad in Haskell. Our contribution is not a revolutionary new idea but rather a modest addition to the set of tools available for making sense of parallel programs. We hope to show that VisPar can be useful as a teaching tool by providing visualisations of a few examples from a course on parallel functional programming.
|
|
| 6. |
- Almström Duregård, Jonas, 1984, et al.
(författare)
-
Embedded Parser Generators
- 2011
-
Ingår i: Haskell'11 Proceedings of the 2011 ACM SIGPLAN Haskell Symposium, Tokyo Japan. - New York, NY, USA : ACM. - 9781450308601 ; , s. 107-117
-
Konferensbidrag (refereegranskat)abstract
- We present a novel method of embedding context-free grammars in Haskell, and to automatically generate parsers and pretty-printers from them. We have implemented this method in a library called BNFC-meta (from the BNF Converter, which it is built on). The library builds compiler front ends using metaprogramming instead of conventional code generation. Parsers are built from labelled BNF grammars that are defined directly in Haskell modules. Our solution combines features of parser generators (static grammar checks, a highly specialised grammar DSL) and adds several features that are otherwise exclusive to combinatory libraries such as the ability to reuse, parameterise and generate grammars inside Haskell.To allow writing grammars in concrete syntax, BNFC-meta provides a quasi-quoter that can parse grammars (embedded in Haskell files) at compile time and use metaprogramming to replace them with their abstract syntax. We also generate quasi-quoters so that the languages we define with BNFC-meta can be embedded in the same way. With a minimal change to the grammar, we support adding anti-quotation to the generated quasi-quoters, which allows users of the defined language to mix concrete and abstract syntax almost seamlessly. Unlike previous methods of achieving anti-quotation, the method used by BNFC-meta is simple, efficient and avoids polluting the abstract syntax types.
|
|
| 7. |
- Almström Duregård, Jonas, 1984, et al.
(författare)
-
Embedded Parser Generators
- 2011
-
Ingår i: SIGPLAN Notices (ACM Special Interest Group on Programming Languages). - : Association for Computing Machinery (ACM). - 0730-8566 .- 0362-1340 .- 1558-1160. ; 46:12, s. 107-117
-
Tidskriftsartikel (refereegranskat)abstract
- We present a novel method of embedding context-free grammars in Haskell, and to automatically generate parsers and pretty-printers from them. We have implemented this method in a library called BNFC-meta (from the BNF Converter, which it is built on). The library builds compiler front ends using metaprogramming instead of conventional code generation. Parsers are built from labelled BNF grammars that are defined directly in Haskell modules. Our solution combines features of parser generators (static grammar checks, a highly specialised grammar DSL) and adds several features that are otherwise exclusive to combinatory libraries such as the ability to reuse, parameterise and generate grammars inside Haskell. To allow writing grammars in concrete syntax, BNFC-meta provides a quasi-quoter that can parse grammars (embedded in Haskell files) at compile time and use metaprogramming to replace them with their abstract syntax. We also generate quasi-quoters so that the languages we define with BNFC-meta can be embedded in the same way. With a minimal change to the grammar, we support adding anti-quotation to the generated quasi-quoters, which allows users of the defined language to mix concrete and abstract syntax almost seamlessly. Unlike previous methods of achieving anti-quotation, the method used by BNFC-meta is simple, efficient and avoids polluting the abstract syntax types.
|
|
| 8. |
- Almström Duregård, Jonas, 1984, et al.
(författare)
-
Feat: Functional Enumeration of Algebraic Types
- 2012
-
Ingår i: 2012 ACM SIGPLAN Haskell Symposium, Haskell 2012. Copenhagen, 13 September 2012. - New York, NY, USA : ACM. - 9781450315746 ; , s. 61-72
-
Konferensbidrag (refereegranskat)abstract
- In mathematics, an enumeration of a set S is a bijective function from (an initial segment of) the natural numbers to S. We define "functional enumerations" as efficiently computable such bijections. This paper describes a theory of functional enumeration and provides an algebra of enumerations closed under sums, products, guarded recursion and bijections. We partition each enumerated set into numbered, finite subsets.We provide a generic enumeration such that the number of each part corresponds to the size of its values (measured in the number of constructors). We implement our ideas in a Haskell library called testing-feat, and make the source code freely available. Feat provides efficient "random access" to enumerated values. The primary application is property-based testing, where it is used to define both random sampling (for example QuickCheck generators) and exhaustive enumeration (in the style of SmallCheck). We claim that functional enumeration is the best option for automatically generating test cases from large groups of mutually recursive syntax tree types. As a case study we use Feat to test the pretty-printer of the Template Haskell library (uncovering several bugs).
|
|
| 9. |
- Amaral, Claudio, 1986, et al.
(författare)
-
Interfacing dynamically typed languages and the why tool: Reasoning about lists and tuples
- 2011
-
Ingår i: Proceedings of the 2011 ACM SIGPLAN Erlang Workshop, Tokyo, 23 September 2011. - New York, NY, USA : ACM. - 9781450308595 ; , s. 92-93
-
Konferensbidrag (refereegranskat)abstract
- Formal software verification is currently contributing to new generations of software systems that are proved to follow a given specification. Unfortunately, most dynamically typed languages lack the tools for such reasoning. We present a tool used to help verify some user specified properties on a small language. The process is based on functional contracts with annotations on the source code that later are transformed into logic goals that need to be proved in order to conclude that the program meets its specification. As part of the tool we also present a term model for dynamically typed data structures.
|
|
| 10. |
- Andersson, Jonas, et al.
(författare)
-
GDF-15 is associated with sudden cardiac death due to incident myocardial infarction
- 2020
-
Ingår i: Resuscitation. - : Elsevier. - 0300-9572 .- 1873-1570. ; 152, s. 165-169
-
Tidskriftsartikel (refereegranskat)abstract
- Aims: Preventing sudden cardiac death (SCD) due to acute myocardial infarction (MI) in previously healthy patients is challenging. Proteomic analysis may lead to an understanding of biological mechanisms and provide predictive biomarkers.Methods: In this prospective, nested case-control study from northern Sweden, 87 candidate cardiovascular protein biomarkers were studied in 244 individuals who later died within 24 h from an incident MI and 244 referents without MI and individually matched for age, sex and date of health examination and alive at the date of event in the index person. Association analysis was conducted using conditional logistic regression. Bonferroni correction was applied to avoid false positive findings.Results: Ten proteins were associated with future SCD due to acute MI in the non-adjusted analysis. The strongest association were found for growth differentiation factor 15 (GDF-15) with an odds ratio (OR) of 1.79 (95% confidence interval [CI] 1.41, 2.25) per standard deviation increase in protein, and urokinase-type plasminogen activator receptor with an OR of 1.66 (95% CI 1.34, 2.06). In models adjusted for lipid levels, body mass index, education, smoking, hypertension and C-reactive protein, only association with GDF-15 remained (OR 1.47 (95% 1.11, 1.95)).Conclusion: Elevated levels of GDF-15 are associated with increased risk of SCD within 24 h of incident MI. Further research may enable the use of GDF-15 together with other clinical and biological markers to guide primary preventive interventions for individuals at high risk for SCD.
|
|
