| 70481. |
- Nilsson, Henrik
(author)
-
A declarative approach to debugging for lazy functional languages
- 1994
-
Licentiate thesis (other academic/artistic)abstract
- Debugging programs written in lazy functional languages is difficult, and there are currently no realistic, general purpose debugging tools available. The basic problem is that computations in general do not take place in the order one might expect. Furthermore, lazy functional languages to a large extent free programmers from concerns regarding operational issues such as evaluation order, i.e. they are ‘declarative’. Debugging should therefore take place at the same, high level of abstraction. Thus, we propose to use algorithmic debugging for lazy functional languages, since this technique allows the user to focus on the declarative semantics of a program.However, algorithmic debugging is based on tracing, and since the trace reflects the operational behaviour of the traced program, the trace should be transformed to abstract away these details if we wish to debug as declaratively as possible. We call this transformation strictification, because it makes the trace more like a trace from a strict language.In this thesis, we present a strictifying algorithmic debugger for a small lazy functional language, and some experience from using it. We also discuss its main shortcomings, and outline a number of ideas for building a more realistic debugger. The single most pressing problem is the size of a complete trace. We propose to use a piecemeal tracing scheme to overcome this, by which only a part of the trace is stored at any one time, other parts being created on demand by re-executing the program.
|
|
| 70482. |
- Nilsson, Henrik, et al.
(author)
-
Algorithmic debugging for lazy functional languages
- 1992
-
In: Programming Language Implementation and Logic Programming. - Berlin/Heidelberg : Springer Berlin/Heidelberg. - 3540558446 ; , s. 385-399
-
Conference paper (peer-reviewed)abstract
- Lazy functional languages have non-strict semantics and are purely declarative, i.e. they support the notion of referential transparency and are devoid of side effects. Traditional debugging techniques are, however, not suited for lazy functional languages since computations generally do not take place in the order one might expect. Since algorithmic debugging allows the user to concentrate on the declarative aspects of program semantics, and will semi-automatically find functions containing bugs, we propose to use this technique for debugging lazy functional programs. In this paper we present an algorithmic debugger for a lazy functional language and some experience in using it. Because of the non-strict semantics of lazy functional languages, arguments to functions are in general partially evaluated expressions. The user is, however, usually more concerned with the values that these expressions represent. We address this problem by providing the user with a strictified view of the execution trace whenever possible.
|
|
| 70483. |
- Nilsson, Hans
(author)
-
Arbete och ohälsa i ett historiskt perspektiv
- 1996
-
In: Arbetsvillkor, yrke och ohälsa i Östergötland. - Linköping : Landstinget i Östergötland. ; , s. 11-22
-
Book chapter (other academic/artistic)abstract
- För snart hundra år sedan, 1896, höll norrköpingsläkaren Johan Hellström ett antal föreläsningar vid Norrköpings arbetareinstitut. Institutet, som var en föreläsningsförening, hade existerat sedan 1885 och var nära kopplat till den liberala arbetareföreningen (en föregångare till fackföreningarna). Hellströms föreläsningar handlade om yrkesjukdomar och industriell hygien. Eftersom han var praktiserande läkare i staden kom han sannolikt ofta i kontakt med sjukdomar som var relaterade till patienternas yrkesliv. Bland annat måste den höga sjukligheten och dödligheten i lungtuberkulos i Norrköping, främst hos arbetarklassen, stimulerat till eftertanke. Hellströms föreläsningar gavs sedan ut i en skriftserie kallad Hälsovännens flygskrifter, en serie där medicinare med intresse för folkhälsoupplysning publicerade nya rön på ett lättfattligt sätt. Detta var den första större moderna sammanställningen på svenska som redovisar medicinens kunskap om sambandet mellan arbete och ohälsa. Intresset för arbetsmiljön är alltså ganska sent påkommet.
|
|
| 70484. |
- Nilsson, Hans
(author)
-
Att använda lokalhistoria i undervisningen : Konferensrapport, juni 1995
- 1995
-
Reports (other academic/artistic)abstract
- Den 6-7 juni 1995 anordnades den fjärde lokalhistoriska konferensen i Linköping. Konferensen, som handlade om lokalhistoria i skolan, uttalade sig för tanken att på sikt skapa ett nationellt kontaktnät för lokalhistoria i skolan. Som ett första steg i denna strävan utsågs ett antal personer att förbereda bildandet av kontaktnätet ( d v s att arbeta med frågorna kring finansiering, nyhetsblad/tidskrift, ledningsgrupp mm). Konferensen beslutade också att ge ut förereliggande häfte med lokalhistoriska exempel hämtade från den svenska skolan.
|
|
| 70485. |
- Nilsson, Heléne, et al.
(author)
-
Attitudes on the use of priority tags
- 2007
-
In: Scandinavian Journal of Trauma, Resuscitation and Emergency Medicine. - London, UK : BioMed Central. - 1757-7241. ; 15, s. 71-73
-
Journal article (peer-reviewed)abstract
- Prioritising of victims as well as the use of priority tags in different colours is an important part of all training in patient management at disasters and major incidents. The actual use of priority tags in incidents and disasters has so far not been systematically studied. The aim of this study was to demonstrate attitudes among researchers as well as prehospital personnel on the actual use of priority tags. In 38 KAMEDO reports issued by the Swedish National Board of Health and Welfare describing major incidents and disasters from 1977-2004, we found no documentation on the use of priority tags. In a questionnaire to personnel within the prehospital medical system 133 (68%) replied that they only have used priority tags in training. 20 (10%) had used priority tags in a real accident/incident and 43 (21%) answered that they have never used priority tags. Reports from incidents should include the issues on the use of priority tags and clearly defi ned criteria on prioritising and labelling of patients at an incident/disaster, as well as in daily work, should be defi ned.
|
|
| 70486. |
- Nilsson, Hans, 1955-, et al.
(author)
-
Bevara kyrksalen som ett byggnadsminne
- 2024
-
Other publication (pop. science, debate, etc.)abstract
- Debattartikel som argumenterar för behovet att bevara den gamla Baptistkyrkan på Klostergatan 46 i Linköping, en byggnad med stort kulturhistoriskt värde.
|
|
| 70487. |
- Nilsson, H C, et al.
(author)
-
Child physical abuse – High school students’ mental health and parental relations depending on who perpetrated the abuse
- 2017
-
In: Child Abuse and Neglect. - : Elsevier BV. - 0145-2134 .- 1873-7757. ; 70, s. 28-38
-
Journal article (peer-reviewed)abstract
- The aim of this study was to contribute to the research of child physical abuse (CPA) by examining if there were any differences in high school students’ mental health (in this study symptoms of depression and anxiety, self-esteem and sense of coherence) and/or, in how they perceive their parents, depending on whether or not they had been subjected to CPA during childhood. In addition, if high school students reported different mental health and/or, relationships with their parents, depending on if their mother, father or both parents were the perpetrators of CPA. A representative national sample of high school students (N = 3288, data collected 2009) participated in the study. Participants completed the following: questions about CPA and alleged perpetrators, the Hopkins Symptom Checklist, Rosenberg Self-Esteem Scale, the Sense of Coherence Scale and Parental Bonding Instrument. The results showed students who reported experiences of CPA were more likely to report symptoms of mental illness and negative perceptions of their parents’ parenting. However, there were no mental health differences depending on whether their mother, father or both parents were the perpetrators of CPA. Still, there were differences in perceived parenting indicating that mothers’ parenting was perceived as more negative when mothers only or both parents were perpetrators of the abuse than when only fathers were perpetrators.
|
|
| 70488. |
- Nilsson, Henric, et al.
(author)
-
Cardiopulmonary exercise testing for evaluation of a randomized exercise training intervention following aortic valve replacement
- 2019
-
In: Clinical Physiology and Functional Imaging. - : WILEY. - 1475-0961 .- 1475-097X. ; 39:1, s. 103-110
-
Journal article (peer-reviewed)abstract
- Aortic valve surgery is the definitive treatment for aortic stenosis (AS). No specific recommendation is available on how exercise training should be conducted and evaluated after aortic valve replacement (AVR). This study aimed to examine the effect of aerobic exercise training on exercise capacity following AVR. In addition to our primary outcome variable, peak oxygen uptake (peakVO(2)), the effect on submaximal cardiopulmonary variables including oxygen uptake kinetics (tau), oxygen uptake efficiency slope (OUES) and ventilatory efficiency (VE/VCO2 slope) was evaluated. Following AVR due to AS, 12 patients were randomized to either a group receiving 12 weeks of supervised aerobic exercise training (EX) or a control group (CON). Exercise capacity was assessed by a maximal cardiopulmonary exercise test (CPET). There was a significant increase in peak load (+28%, P = 0 center dot 031) and in peakVO(2) (+23%, P = 0 center dot 031) in EX, corresponding to an increase in achieved percentage of predicted peakVO(2) from 88 to 104% (P = 0 center dot 031). For submaximal variables, there were only non-statistically significant trends in improvement between CPETs in EX. In CON, there were no significant differences in any maximal or submaximal variable between CPETs. We conclude that 12 weeks of supervised aerobic exercise training induces significant adaptations in cardiopulmonary function following AVR, especially in regard to maximal variables including peakVO(2). In addition, we provide novel data on the effect on several submaximal variables following exercise training in this group of patients.
|
|
| 70489. |
- Nilsson, Henrik, et al.
(author)
-
Declarative Algorithmic Debugging for Lazy Functional Languages
- 1994
-
In: Journal of functional programming (Print). - : Cambridge University Press. - 0956-7968 .- 1469-7653. ; 4:3, s. 337-370
-
Journal article (peer-reviewed)abstract
- Lazy functional languages are declarative and allow the programmer to write programs where operational issues such as the evaluation order are left implicit. It is desirable to maintain a declarative view also during debugging so as to avoid burdening the programmer with operational details, for example concerning the actual evaluation order which tends to be difficult to follow. Conventional debugging techniques focus on the operational behaviour of a program and thus do not constitute a suitable foundation for a general-purpose debugger for lazy functional languages. Yet, the only readily available, general-purpose debugging tools for this class of languages are simple, operational tracers. This thesis presents a technique for debugging lazy functional programs declaratively and an efficient implementation of a declarative debugger for a large subset of Haskell. As far as we know, this is the first implementation of such a debugger which is sufficiently efficient to be useful in practice. Our approach is to construct a declarative trace which hides the operational details, and then use this as the input to a declarative (in our case algorithmic) debugger. The main contributions of this thesis are: A basis for declarative debugging of lazy functional programs is developed in the form of a trace which hides operational details. We call this kind of trace the Evaluation Dependence Tree (EDT). We show how to construct EDTs efficiently in the context of implementations of lazy functional languages based on graph reduction. Our implementation shows that the time penalty for tracing is modest, and that the space cost can be kept below a user definable limit by storing one portion of the EDT at a time. Techniques for reducing the size of the EDT are developed based on declaring modules to be trusted and designating certain functions as starting-points for tracing. We show how to support source-level debugging within our framework. A large subset of Haskell is handled, including list comprehensions. Language implementations are discussed from a debugging perspective, in particular what kind of support a debugger needs from the compiler and the run-time system. We present a working reference implementation consisting of a compiler for a large subset of Haskell and an algorithmic debugger. The compiler generates fairly good code, also when a program is compiled for debugging, and the resource consumption during debugging is modest. The system thus demonstrates the feasibility of our approach
|
|
| 70490. |
- Nilsson, Henrik, 1966-
(author)
-
Declarative debugging for lazy functional languages
- 1998
-
Doctoral thesis (other academic/artistic)abstract
- Lazy functional languages are declarative and allow the programmer to write programs where operational issues such as the evaluation order are left implicit. It is desirable to maintain a declarative view also during debugging so as to avoid burdening the programmer with operational details, for example concerning the actual evaluation order which tends to be difficult to follow. Conventional debugging techniques focus on the operational behaviour of a program and thus do not constitute a suitable foundation for a general-purpose debugger for lazy functional languages. Yet, the only readily available, general-purpose debugging tools for this class of languages are simple, operational tracers.This thesis presents a technique for debugging lazy functional programs declaratively and an efficient implementation of a declarative debugger for a large subset of Haskell. As far as we know, this is the first implementation of such a debugger which is sufficiently efficient to be useful in practice. Our approach is to construct a declarative trace which hides the operational details, and then use this as the input to a declarative (in our case algorithmic) debugger.The main contributions of this thesis are:A basis for declarative debugging of lazy functional programs is developed in the form of a trace which hides operational details. We call this kind of trace the Evaluation Dependence Tree (EDT).We show how to construct EDTs efficiently in the context of implementations of lazy functional languages based on graph reduction. Our implementation shows that the time penalty for tracing is modest, and that the space cost can be kept below a user definable limit by storing one portion of the EDT at a time.Techniques for reducing the size of the EDT are developed based on declaring modules to be trusted and designating certain functions as starting-points for tracing.We show how to support source-level debugging within our framework. A large subset of Haskell is handled, including list comprehensions.Language implementations are discussed from a debugging perspective, in particular what kind of support a debugger needs from the compiler and the run-time system.We present a working reference implementation consisting of a compiler for a large subset of Haskell and an algorithmic debugger. The compiler generates fairly good code, also when a program is compiled for debugging, and the resource consumption during debugging is modest. The system thus demonstrates the feasibility of our approach.
|
|
