Refine
Year of publication
- 2008 (6) (remove)
Document Type
- Working Paper (5)
- Article (1)
Language
- English (6)
Has Fulltext
- yes (6)
Is part of the Bibliography
- no (6)
Keywords
- Lambda-Kalkül (4)
- Operationale Semantik (4)
- Programmiersprache (4)
- lambda calculus (1)
- nondeterminism (1)
- programming languages (1)
- semantics (1)
- translation (1)
Institute
- Informatik (5)
- Medizin (1)
Background: Platelet activating factor and tachykinins (substance P, neurokinin A, neurokinin B) are important mediators contributing to increased airway secretion in the context of different types of respiratory diseases including acute and chronic asthma. Leukotriene receptor antagonists are recommended as add-on therapy for this disease. The cys-leukotriene-1 receptor antagonist montelukast has been used in clinical asthma therapy during the last years. Besides its inhibitory action on bronchoconstriction, only little is known about its effects on airway secretions. Therefore, the aim of this study was to evaluate the effects of montelukast on platelet activating factor- and tachykinin induced tracheal secretory activity.
Methods: The effects of montelukast on platelet activating factor- and tachykinin induced tracheal secretory activity in the rat were assessed by quantification of secreted 35SO4 labelled mucus macromolecules using the modified Ussing chamber technique.
Results: Platelet activating factor potently stimulated airway secretion, which was completely inhibited by the platelet activating factor receptor antagonist WEB 2086 and montelukast. In contrast, montelukast had no effect on tachykinin induced tracheal secretory activity.
Conclusion: Cys-leukotriene-1 receptor antagonism by montelukast reverses the secretagogue properties of platelet activating factor to the same degree as the specific platelet activating factor antagonist WEB 2086 but has no influence on treacheal secretion elicited by tachykinins. These results suggest a role of montelukast in the signal transduction pathway of platelet activating factor induced secretory activity of the airways and may further explain the beneficial properties of cys-leukotriene-1 receptor antagonists.
We investigate methods and tools for analysing translations between programming languages with respect to observational semantics. The behaviour of programs is observed in terms of may- and must-convergence in arbitrary contexts, and adequacy of translations, i.e., the reflection of program equivalence, is taken to be the fundamental correctness condition. For compositional translations we propose a notion of convergence equivalence as a means for proving adequacy. This technique avoids explicit reasoning about contexts, and is able to deal with the subtle role of typing in implementations of language extension.
Various concurrency primitives have been added to sequential programming languages, in order to turn them concurrent. Prominent examples are concurrent buffers for Haskell, channels in Concurrent ML, joins in JoCaml, and handled futures in Alice ML. Even though one might conjecture that all these primitives provide the same expressiveness, proving this equivalence is an open challenge in the area of program semantics. In this paper, we establish a first instance of this conjecture. We show that concurrent buffers can be encoded in the lambda calculus with futures underlying Alice ML. Our correctness proof results from a systematic method, based on observational semantics with respect to may and must convergence.
We investigate methods and tools for analyzing translations between programming languages with respect to observational semantics. The behavior of programs is observed in terms of may- and mustconvergence in arbitrary contexts, and adequacy of translations, i.e., the reflection of program equivalence, is taken to be the fundamental correctness condition. For compositional translations we propose a notion of convergence equivalence as a means for proving adequacy. This technique avoids explicit reasoning about contexts, and is able to deal with the subtle role of typing in implementations of language extensions.
We investigate methods and tools for analysing translations between programming languages with respect to observational semantics. The behaviour of programs is observed in terms of may- and mustconvergence in arbitrary contexts, and adequacy of translations, i.e., the reflection of program equivalence, is taken to be the fundamental correctness condition. For compositional translations we propose a notion of convergence equivalence as a means for proving adequacy. This technique avoids explicit reasoning about contexts, and is able to deal with the subtle role of typing in implementations of language extensions.
We investigate methods and tools for analysing translations between programming languages with respect to observational semantics. The behaviour of programs is observed in terms of may- and mustconvergence in arbitrary contexts, and adequacy of translations, i.e., the reflection of program equivalence, is taken to be the fundamental correctness condition. For compositional translations we propose a notion of convergence equivalence as a means for proving adequacy. This technique avoids explicit reasoning about contexts, and is able to deal with the subtle role of typing in implementations of language extensions.