| 1. |
- Lozano, Rafael, et al.
(författare)
-
Measuring progress from 1990 to 2017 and projecting attainment to 2030 of the health-related Sustainable Development Goals for 195 countries and territories: a systematic analysis for the Global Burden of Disease Study 2017
- 2018
-
Ingår i: The Lancet. - : Elsevier. - 1474-547X .- 0140-6736. ; 392:10159, s. 2091-2138
-
Tidskriftsartikel (refereegranskat)abstract
- Background: Efforts to establish the 2015 baseline and monitor early implementation of the UN Sustainable Development Goals (SDGs) highlight both great potential for and threats to improving health by 2030. To fully deliver on the SDG aim of “leaving no one behind”, it is increasingly important to examine the health-related SDGs beyond national-level estimates. As part of the Global Burden of Diseases, Injuries, and Risk Factors Study 2017 (GBD 2017), we measured progress on 41 of 52 health-related SDG indicators and estimated the health-related SDG index for 195 countries and territories for the period 1990–2017, projected indicators to 2030, and analysed global attainment. Methods: We measured progress on 41 health-related SDG indicators from 1990 to 2017, an increase of four indicators since GBD 2016 (new indicators were health worker density, sexual violence by non-intimate partners, population census status, and prevalence of physical and sexual violence [reported separately]). We also improved the measurement of several previously reported indicators. We constructed national-level estimates and, for a subset of health-related SDGs, examined indicator-level differences by sex and Socio-demographic Index (SDI) quintile. We also did subnational assessments of performance for selected countries. To construct the health-related SDG index, we transformed the value for each indicator on a scale of 0–100, with 0 as the 2·5th percentile and 100 as the 97·5th percentile of 1000 draws calculated from 1990 to 2030, and took the geometric mean of the scaled indicators by target. To generate projections through 2030, we used a forecasting framework that drew estimates from the broader GBD study and used weighted averages of indicator-specific and country-specific annualised rates of change from 1990 to 2017 to inform future estimates. We assessed attainment of indicators with defined targets in two ways: first, using mean values projected for 2030, and then using the probability of attainment in 2030 calculated from 1000 draws. We also did a global attainment analysis of the feasibility of attaining SDG targets on the basis of past trends. Using 2015 global averages of indicators with defined SDG targets, we calculated the global annualised rates of change required from 2015 to 2030 to meet these targets, and then identified in what percentiles the required global annualised rates of change fell in the distribution of country-level rates of change from 1990 to 2015. We took the mean of these global percentile values across indicators and applied the past rate of change at this mean global percentile to all health-related SDG indicators, irrespective of target definition, to estimate the equivalent 2030 global average value and percentage change from 2015 to 2030 for each indicator. Findings: The global median health-related SDG index in 2017 was 59·4 (IQR 35·4–67·3), ranging from a low of 11·6 (95% uncertainty interval 9·6–14·0) to a high of 84·9 (83·1–86·7). SDG index values in countries assessed at the subnational level varied substantially, particularly in China and India, although scores in Japan and the UK were more homogeneous. Indicators also varied by SDI quintile and sex, with males having worse outcomes than females for non-communicable disease (NCD) mortality, alcohol use, and smoking, among others. Most countries were projected to have a higher health-related SDG index in 2030 than in 2017, while country-level probabilities of attainment by 2030 varied widely by indicator. Under-5 mortality, neonatal mortality, maternal mortality ratio, and malaria indicators had the most countries with at least 95% probability of target attainment. Other indicators, including NCD mortality and suicide mortality, had no countries projected to meet corresponding SDG targets on the basis of projected mean values for 2030 but showed some probability of attainment by 2030. For some indicators, including child malnutrition, several infectious diseases, and most violence measures, the annualised rates of change required to meet SDG targets far exceeded the pace of progress achieved by any country in the recent past. We found that applying the mean global annualised rate of change to indicators without defined targets would equate to about 19% and 22% reductions in global smoking and alcohol consumption, respectively; a 47% decline in adolescent birth rates; and a more than 85% increase in health worker density per 1000 population by 2030. Interpretation: The GBD study offers a unique, robust platform for monitoring the health-related SDGs across demographic and geographic dimensions. Our findings underscore the importance of increased collection and analysis of disaggregated data and highlight where more deliberate design or targeting of interventions could accelerate progress in attaining the SDGs. Current projections show that many health-related SDG indicators, NCDs, NCD-related risks, and violence-related indicators will require a concerted shift away from what might have driven past gains—curative interventions in the case of NCDs—towards multisectoral, prevention-oriented policy action and investments to achieve SDG aims. Notably, several targets, if they are to be met by 2030, demand a pace of progress that no country has achieved in the recent past. The future is fundamentally uncertain, and no model can fully predict what breakthroughs or events might alter the course of the SDGs. What is clear is that our actions—or inaction—today will ultimately dictate how close the world, collectively, can get to leaving no one behind by 2030.
|
|
| 2. |
- Li, He, et al.
(författare)
-
Identification of a Sjögren's syndrome susceptibility locus at OAS1 that influences isoform switching, protein expression, and responsiveness to type I interferons
- 2017
-
Ingår i: PLOS Genetics. - : PUBLIC LIBRARY SCIENCE. - 1553-7390 .- 1553-7404. ; 13:6
-
Tidskriftsartikel (refereegranskat)abstract
- Sjogren's syndrome (SS) is a common, autoimmune exocrinopathy distinguished by keratoconjunctivitis sicca and xerostomia. Patients frequently develop serious complications including lymphoma, pulmonary dysfunction, neuropathy, vasculitis, and debilitating fatigue. Dysregulation of type I interferon (IFN) pathway is a prominent feature of SS and is correlated with increased autoantibody titers and disease severity. To identify genetic determinants of IFN pathway dysregulation in SS, we performed cis-expression quantitative trait locus (eQTL) analyses focusing on differentially expressed type I IFN-inducible transcripts identified through a transcriptome profiling study. Multiple cis-eQTLs were associated with transcript levels of 2'-5'-oligoadenylate synthetase 1 (OAS1) peaking at rs10774671 (PeQTL = 6.05 x 10(-14)). Association of rs10774671 with SS susceptibility was identified and confirmed through meta-analysis of two independent cohorts (P-meta = 2.59 x 10(-9); odds ratio = 0.75; 95% confidence interval = 0.66-0.86). The risk allele of rs10774671 shifts splicing of OAS1 from production of the p46 isoform to multiple alternative transcripts, including p42, p48, and p44. We found that the isoforms were differentially expressed within each genotype in controls and patients with and without autoantibodies. Furthermore, our results showed that the three alternatively spliced isoforms lacked translational response to type I IFN stimulation. The p48 and p44 isoforms also had impaired protein expression governed by the 3' end of the transcripts. The SS risk allele of rs10774671 has been shown by others to be associated with reduced OAS1 enzymatic activity and ability to clear viral infections, as well as reduced responsiveness to IFN treatment. Our results establish OAS1 as a risk locus for SS and support a potential role for defective viral clearance due to altered IFN response as a genetic pathophysiological basis of this complex autoimmune disease.
|
|
| 3. |
- Liu, Ke, et al.
(författare)
-
X Chromosome Dose and Sex Bias in Autoimmune Diseases
- 2016
-
Ingår i: Arthritis & Rheumatology. - : WILEY-BLACKWELL. - 2326-5191 .- 2326-5205. ; 68:5, s. 1290-1300
-
Tidskriftsartikel (refereegranskat)abstract
- Objective. More than 80% of autoimmune disease predominantly affects females, but the mechanism for this female bias is poorly understood. We suspected that an X chromosome dose effect accounts for this, and we undertook this study to test our hypothesis that trisomy X (47, XXX; occurring in similar to 1 in 1,000 live female births) would be increased in patients with female-predominant diseases (systemic lupus erythematosus [SLE], primary Sjogrens syndrome [SS], primary biliary cirrhosis, and rheumatoid arthritis [RA]) compared to patients with diseases without female predominance (sarcoidosis) and compared to controls. Methods. All subjects in this study were female. We identified subjects with 47, XXX using aggregate data from single-nucleotide polymorphism arrays, and, when possible, we confirmed the presence of 47, XXX using fluorescence in situ hybridization or quantitative polymerase chain reaction. Results. We found 47, XXX in 7 of 2,826 SLE patients and in 3 of 1,033 SS patients, but in only 2 of 7,074 controls (odds ratio in the SLE and primary SS groups 8.78 [95% confidence interval 1.67-86.79], P = 0.003 and odds ratio 10.29 [95% confidence interval 1.18-123.47], P = 0.02, respectively). One in 404 women with SLE and 1 in 344 women with SS had 47, XXX. There was an excess of 47, XXX among SLE and SS patients. Conclusion. The estimated prevalence of SLE and SS in women with 47, XXX was similar to 2.5 and similar to 2.9 times higher, respectively, than that in women with 46, XX and similar to 25 and similar to 41 times higher, respectively, than that in men with 46, XY. No statistically significant increase of 47, XXX was observed in other female-biased diseases (primary biliary cirrhosis or RA), supporting the idea of multiple pathways to sex bias in autoimmunity.
|
|
| 4. |
- Arts, Thomas, 1969, et al.
(författare)
-
Graphical editing support for QuickCheck models
- 2015
-
Ingår i: 2015 IEEE 8th International Conference on Software Testing, Verification and Validation Workshops, ICSTW 2015 - Proceedings. - 2159-4848. - 9781479918850
-
Konferensbidrag (refereegranskat)abstract
- QuickCheck can test a system by specifying a state machine for the API exported by that system. This state machine specification includes a list of possible API calls. Each call is accompanied by a precondition, a postcondition, a generator for the arguments, and a description of how the state is changed. Based on this specification QuickCheck generates a random sequence of API calls. The preconditions ensure that a generated sequence is valid, and the postconditions check that the system behaves as expected. Many systems require an initialisation call before other calls, describing the transition from an uninitialized to an initialised state. QuickCheck offers two ways of specifying transitions between states: using preconditions or a finite state machine abstraction. In this paper we show, by means of an example, that the latter approach is to be preferred. In addition, we present a recent extension to QuickCheck that allows a user to graphically create and edit a finite state machine specification. This extension simplifies and speeds up the specification of a finite state machine, which can be regarded as a formal model of the system, considerably. The graphical representation makes the formal model easier to understand, and visualises the distribution of API calls. Moreover, the extension allows the user to change this distribution.
|
|
| 5. |
- Arts, Thomas, 1969, et al.
(författare)
-
Testing AUTOSAR software with QuickCheck
- 2015
-
Ingår i: 2015 IEEE 8th International Conference on Software Testing, Verification and Validation Workshops, ICSTW 2015 - Proceedings. - 2159-4848. - 9781479918850
-
Konferensbidrag (refereegranskat)abstract
- AUTOSAR (AUTomotive Open System ARchitecture) is an evolving standard for embedded software in vehicles, defined by the automotive industry, and implemented by many different vendors. On behalf of Volvo Cars, we have developed model-based acceptance tests for some critical AUTOSAR components, to guarantee that implementations from different vendors are compatible. We translated over 3000 pages of textual specifications into QuickCheck models, and tested many different implementations using large volumes of generated tests. This exposed over 200 issues, which we raised with Volvo and the software vendors. Compared to an earlier manual approach, ours is more efficient, more effective, and more correct.
|
|
| 6. |
- Byrski, Aleksander, et al.
(författare)
-
Special section on functional paradigm for high performance computing
- 2018
-
Ingår i: Future Generation Computer Systems. - : Elsevier BV. - 0167-739X. ; 79, s. 643-644
-
Tidskriftsartikel (övrigt vetenskapligt/konstnärligt)abstract
- This paper is a foreword for the Special Section of Future Generation Computing Systems journal on Functional Paradigm for High-Performance Computing connected with Lambda Days 2017 Conference. In this paper the substance of the special section is located in the current state of the art and the overviews of the four papers constituting this special section are given. © 2017
|
|
| 7. |
- Fetscher, B., et al.
(författare)
-
Making Random Judgments: Automatically Generating Well-Typed Terms from the Definition of a Type-System
- 2015
-
Ingår i: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). - Berlin, Heidelberg : Springer Berlin Heidelberg. - 1611-3349 .- 0302-9743. ; 9032, s. 383-405
-
Tidskriftsartikel (refereegranskat)abstract
- This paper presents a generic method for randomly generating well-typed expressions. It starts from a specification of a typing judgment in PLT Redex and uses a specialized solver that employs randomness to find many different valid derivations of the judgment form. Our motivation for building these random terms is to more effectively falsify conjectures as part of the tool-support for semantics models specified in Redex. Accordingly, we evaluate the generator against the other available methods for Redex, as well as the best available custom well-typed term generator. Our results show that our new generator is much more effective than generation techniques that do not explicitly take types into account and is competitive with generation techniques that do, even though they are specialized to particular type-systems and ours is not.
|
|
| 8. |
- Gerdes, Alex, 1978, et al.
(författare)
-
Linking Unit Tests and Properties
- 2015
-
Ingår i: Erlang Workshop, 2015-09-04, Vancouver. - New York, NY, USA : ACM. - 9781450338059 ; , s. 19-26
-
Konferensbidrag (refereegranskat)abstract
- QuickCheck allows you to validate if your software has particular desired properties. These properties can be regarded as an abstraction over many unit tests. QuickCheck uses generated random input data to validate such a property. If QuickCheck finds a counterexample it becomes immediately clear what we are testing. If however all tests pass it is not immediately clear what we have tested, since we don’t see the actual generated test cases. In this case it is good to think about what we have actually tested. QuickCheck offers the possibility to gather statistics about the test cases, which is very insightful. Still, after inspecting the test data distribution many QuickCheck users wonder if a particular unit test case has been tested. Often a property is developed with a certain set of unit tests in mind. We have developed a tool that check if a given unit test can be generated by a property. This tool helps in understanding a property, making it easier to see what it really tests and hence judge its quality.
|
|
| 9. |
- Gerdes, Alex, 1978, et al.
(författare)
-
Understanding formal specifications through good examples
- 2018
-
Ingår i: Erlang 2018 - Proceedings of the 17th ACM SIGPLAN International Workshop on Erlang, co-located with ICFP 2018. - New York, NY, USA : ACM. ; , s. 13-24
-
Konferensbidrag (refereegranskat)abstract
- Formal specifications of software applications are hard to understand, even for domain experts. Because a formal specification is abstract, reading it does not immediately convey the expected behaviour of the software. Carefully chosen examples of the software’s behaviour, on the other hand, are concrete and easy to understand—but poorly-chosen examples are more confusing than helpful. In order to understand formal specifications, software developers need good examples. We have created a method that automatically derives a suite of good examples from a formal specification. Each example is judged by our method to illustrate one feature of the specification. The generated examples give users a good understanding of the behaviour of the software. We evaluated our method by measuring how well students understood an API when given different sets of examples; the students given our examples showed significantly better understanding.
|
|
| 10. |
- Hritcu, C., et al.
(författare)
-
Testing noninterference, quickly
- 2016
-
Ingår i: Journal of Functional Programming. - : Cambridge University Press (CUP). - 1469-7653 .- 0956-7968. ; 26
-
Tidskriftsartikel (refereegranskat)abstract
- Information-flow control mechanisms are difficult both to design and to prove correct. To reduce the time wasted on doomed proof attempts due to broken definitions, we advocate modern random-testing techniques for finding counterexamples during the design process. We show how to use QuickCheck, a property-based random-testing tool, to guide the design of increasingly complex information-flow abstract machines, leading up to a sophisticated register machine with a novel and highly permissive flow-sensitive dynamic enforcement mechanism that is sound in the presence of first-class public labels. We find that both sophisticated strategies for generating well-distributed random programs and readily falsifiable formulations of noninterference properties are critically important for efficient testing. We propose several approaches and evaluate their effectiveness on a collection of injected bugs of varying subtlety. We also present an effective technique for shrinking large counterexamples to minimal, easily comprehensible ones. Taken together, our best methods enable us to quickly and automatically generate simple counterexamples for more than 45 bugs. Moreover, we show how testing guides the discovery of the sophisticated invariants needed for the noninterference proof of our most complex machine.
|
|
| 11. |
- Hu, Z. J., et al.
(författare)
-
How functional programming mattered
- 2015
-
Ingår i: National Science Review. - : Oxford University Press (OUP). - 2095-5138 .- 2053-714X. ; 2:3, s. 349-370
-
Forskningsöversikt (refereegranskat)abstract
- In 1989 when functional programming was still considered a niche topic, Hughes wrote a visionary paper arguing convincingly 'why functional programming matters'. More than two decades have passed. Has functional programming really mattered? Our answer is a resounding 'Yes!'. Functional programming is now at the forefront of a new generation of programming technologies, and enjoying increasing popularity and influence. In this paper, we review the impact of functional programming, focusing on how it has changed the way we may construct programs, the way we may verify programs, and fundamentally the way we may think about programs.
|
|
| 12. |
- Hughes, John, 1958
(författare)
-
Experiences with QuickCheck: testing the hard stuff and staying sane
- 2016
-
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. - 9783319309354 ; 9600, s. 169-186
-
Konferensbidrag (refereegranskat)abstract
- This is not a typical scientific paper. It does not present a new method, with careful experiments to evaluate it, and detailed references to related work. Rather, it recounts some of my experiences over the last 15 years, working with QuickCheck, and its purpose is as much to entertain as to inform. QuickCheck is a random testing tool that Koen Claessen and I invented, which has since become the testing tool of choice in the Haskell community. In 2006 I co-founded Quviq, to develop and market an Erlang version, which we have since applied for a wide variety of customers, encountering many fascinating testing problems as a result. This paper introduces Quviq QuickCheck, and in particular the extensions made for testing stateful code, via a toy example in C. It goes on to describe the largest QuickCheck project to date, which developed acceptance tests for AUTOSAR C code on behalf of Volvo Cars. Finally it explains a race detection method that nailed a notorious bug plaguing Klarna, northern Europe’s market leader in invoicing systems for e-commerce. Together, these examples give a reasonable overview of the way QuickCheck has been used in industrial practice.
|
|
| 13. |
- Hughes, John, 1958, et al.
(författare)
-
Find More Bugs with QuickCheck!
- 2016
-
Ingår i: 11th IEEE/ACM International Workshop on Automation of Software Test (AST 2016). - New York, NY, USA : ACM. - 9781450341516 ; , s. 71-77
-
Konferensbidrag (refereegranskat)abstract
- Random testing is increasingly popular and successful, but tends to spend most time rediscovering the ``most probable bugs'' again and again, reducing the value of long test runs on buggy software. We present a new automated method to adapt random test case generation so that already-discovered bugs are avoided, and further test effort can bedevoted to searching for new bugs instead. We evaluate ourmethod primarily against RANDOOP-style testing, in three different settings our method avoids rediscovering bugs more successfully than RANDOOP and in some cases finds bugs that RANDOOP did not find at all.
|
|
| 14. |
- Hughes, John, 1958, et al.
(författare)
-
How well are your requirements tested?
- 2016
-
Ingår i: Proceedings - 2016 IEEE International Conference on Software Testing, Verification and Validation, ICST 2016. - 9781509018260 ; , s. 244-254
-
Konferensbidrag (refereegranskat)abstract
- We address the question: to what extent does covering requirements ensure that a test suite is effective at revealing faults? To answer it, we generate minimal test suites that cover all requirements, and assess the tests they contain. They turn out to be very poor-ultimately because the notion of covering a requirement is more subtle than it appears to be at first. We propose several improvements to requirements tracking during testing, which enable us to generate minimal test suites close to what a human developer would write. However, there remains a class of plausible bugs which such suites are very poor at finding, but which random testing finds rather easily.
|
|
| 15. |
- Hughes, John, 1958, et al.
(författare)
-
Mysteries of Dropbox: Property-based Testing of a Distributed Synchronization Service
- 2016
-
Ingår i: Proceedings - 2016 IEEE International Conference on Software Testing, Verification and Validation, ICST 2016. - 9781509018260 ; , s. 135-145
-
Konferensbidrag (refereegranskat)abstract
- File synchronization services such as Dropbox are used by hundreds ofmillions of people to replicate vital data. Yet rigorous models of theirbehavior are lacking. We present the first formal---and testable---model ofthe core behavior of a modern file synchronizer, and we use it to discoversurprising behavior in two widely deployed synchronizers. Our model isbased on a technique for testing nondeterministic systems that avoidsrequiring that the system's internal choices be made visible to the testingframework.
|
|
| 16. |
- Lampropoulos, Leonidas, et al.
(författare)
-
Beginner's luck: a language for property-based generators
- 2017
-
Ingår i: SIGPLAN Notices (ACM Special Interest Group on Programming Languages). - New York, NY, USA : ACM. - 0730-8566. ; 52:1, s. 114-129
-
Konferensbidrag (refereegranskat)abstract
- Property-based random testing a la QuickCheck requires building efficient generators for well-distributed random data satisfying complex logical predicates, but writing these generators can be difficult and error prone. We propose a domain-specific language in which generators are conveniently expressed by decorating predicates with lightweight annotations to control both the distribution of generated values and the amount of constraint solving that happens before each variable is instantiated. This language, called Luck, makes generators easier to write, read, and maintain. We give Luck a formal semantics and prove several fundamental properties, including the soundness and completeness of random generation with respect to a standard predicate semantics. We evaluate Luck on common examples from the property-based testing literature and on two significant case studies, showing that it can be used in complex domains with comparable bug-finding effectiveness and a significant reduction in testing code size compared to handwritten generators.
|
|
| 17. |
- Mista, Claudio Agustin, 1991, et al.
(författare)
-
Branching Processes for QuickCheck Generators
- 2018
-
Ingår i: Haskell 2018 - Proceedings of the 11th ACM SIGPLAN International Symposium on Haskell, co-located with ICFP 2018. - New York, NY, USA : ACM. ; 53:7, s. 1-13
-
Konferensbidrag (refereegranskat)abstract
- In QuickCheck (or, more generally, random testing), it is challenging to control random data generators' distributions---specially when it comes to user-defined algebraic data types (ADT). In this paper, we adapt results from an area of mathematics known as branching processes, and show how they help to analytically predict (at compile-time) the expected number of generated constructors, even in the presence of mutually recursive or composite ADTs. Using our probabilistic formulas, we design heuristics capable of automatically adjusting probabilities in order to synthesize generators which distributions are aligned with users' demands. We provide a Haskell implementation of our mechanism in a tool called DRaGeN and perform case studies with real-world applications. When generating random values, our synthesized QuickCheck generators show improvements in code coverage when compared with those automatically derived by state-of-the-art tools.
|
|
| 18. |
- Mostowski, Wojciech, 1976-, et al.
(författare)
-
Modelling of Autosar Libraries for Large Scale Testing
- 2017
-
Ingår i: 2nd Workshop on Models for Formal Analysis of Real Systems (MARS 2017). ; 244, s. 184-199
-
Konferensbidrag (refereegranskat)abstract
- We demonstrate a specific method and technology for model-based testing of large software projects with the QuickCheck tool using property-based specifications. Our specifications are very precise, state-full models of the software under test (SUT). In our approach we define (a) formal descriptions of valid function call sequences (public API), (b) postconditions that check the validity of each call, and (c) call-out specifications that define and validate external system interactions (SUT calling external API). The QuickCheck tool automatically generates and executes tests from these specifications. Commercially, this method and tool have been used to test large parts of the industrially developed automotive libraries based on the Autosar standard. In this paper, we exemplify our approach with a circular buffer specified by Autosar, to demonstrate the capabilities of the model-based testing method of QuickCheck. Our example is small compared to the commercial QuickCheck models, but faithfully addresses many of the same challenges. © W. Mostowski, T. Arts, J. Hughes.
|
|
| 19. |
|
|
| 20. |
- Valliappan, Nachiappan, 1992, et al.
(författare)
-
Typing the Wild in Erlang
- 2018
-
Ingår i: Erlang 2018 - Proceedings of the 17th ACM SIGPLAN International Workshop on Erlang, co-located with ICFP 2018. - New York, NY, USA : ACM. ; , s. 49-60
-
Konferensbidrag (refereegranskat)abstract
- Developing a static type system suitable for Erlang has been of ongoing interest for almost two decades now. The challenge with retrofitting a static type system onto a dynamically typed language, such as Erlang, is the loss of flexibility in programming offered by the language. In light of this, many attempts to type Erlang trade sound type checking for the ability to retain flexibility. Hence, simple type errors which would be caught by the type checker of a statically typed language are easily missed in these developments. This has us wishing for a way to avoid such errors in Erlang programs. In this paper, we develop a static type system for Erlang which strives to remain sound without being too restrictive. Our type system is based on Hindley-Milner type inference, however it - -unlike contemporary implementations of Hindley-Milner - -is flexible enough to allow overloading of data constructors, branches of different types etc. Further, to allow Erlang's dynamic type behaviour, we employ a program specialization technique called partial evaluation. Partial evaluation simplifies programs prior to type checking, and hence enables the type system to type such behaviour under certain restricted circumstances.
|
|
| 21. |
- Van Horn, David, et al.
(författare)
-
Preface (Lecture Notes in Computer Science)
- 2019
-
Ingår i: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). - 1611-3349 .- 0302-9743. ; 10447 LNCS
-
Tidskriftsartikel (övrigt vetenskapligt/konstnärligt)
|
|
