The Experts below are selected from a list of 59496 Experts worldwide ranked by ideXlab platform
Sandra C Buttigieg - One of the best experts on this subject based on the ideXlab platform.
-
continuous quality improvement in a maltese hospital using Logical Framework analysis
Journal of Health Organisation and Management, 2016Co-Authors: Sandra C Buttigieg, Dorothy Gauci, Prasanta Kumar DeyAbstract:Purpose: The purpose of this paper is to present the application of Logical Framework analysis (LFA) for implementing continuous quality improvement (CQI) across multiple settings in a tertiary care hospital. Design/methodology/approach: This study adopts a multiple case study approach. LFA is implemented within three diverse settings, namely, intensive care unit, surgical ward, and acute in-patient psychiatric ward. First, problem trees are developed in order to determine the root causes of quality issues, specific to the three settings. Second, objective trees are formed suggesting solutions to the quality issues. Third, project plan template using Logical Framework (LOGFRAME) is created for each setting. Findings: This study shows substantial improvement in quality across the three settings. LFA proved to be effective to analyse quality issues and suggest improvement measures objectively. Research limitations/implications: This paper applies LFA in specific, albeit, diverse settings in one hospital. For validation purposes, it would be ideal to analyse in other settings within the same hospital, as well as in several hospitals. It also adopts a bottom-up approach when this can be triangulated with other sources of data. Practical implications: LFA enables top management to obtain an integrated view of performance. It also provides a basis for further quantitative research on quality management through the identification of key performance indicators and facilitates the development of a business case for improvement. Originality/value: LFA is a novel approach for the implementation of CQI programs. Although LFA has been used extensively for project development to source funds from development banks, its application in quality improvement within healthcare projects is scant.
Frank Pfenning - One of the best experts on this subject based on the ideXlab platform.
-
Termination and Reduction Checking in the Logical Framework
2018Co-Authors: Brigitte Pientka, Frank PfenningAbstract:The Logical Framework LF [HHP93] offers concise encodings of deductive systems and their meta-theory. Twelf [SP98] is a realization of LF. It provides a higher-order logic programming language for the implementation of deductive systems as well as a higher-order inductive theorem prover to automatically prove properties about these systems. The inductive theorem prover has been used successfully to prove several challenging theorems like cut-admissibility of intuitionistic logic and the Church-Rosser theorem. Under the proofs-as-programs paradigm the application of the induction hypothesis (IH) in a proof corresponds to the recursive call in a program. To check that the IH application is valid, we need to show that the induction hypothesis is smaller than the induction conclusion according to a well-founded order. This corresponds to proving that the arguments in the recursive call decrease according to a well-founded order, i.e., a program terminates. Twelf uses a termination checker based on structural ordering [RP96] to check termination of programs and to generate valid induction hypotheses according to a given order
-
Trace matching in a concurrent Logical Framework
Proceedings of the seventh international workshop on Logical frameworks and meta-languages theory and practice - LFMTP '12, 2012Co-Authors: Iliano Cervesato, Frank Pfenning, Carsten Schürmann, Jorge Luis Sacchini, Robert J. SimmonsAbstract:Matching and unification play an important role in implementations of proof assistants, Logical Frameworks, and logic programming languages. In particular, matching is at the heart of many reasoning tasks and underlies the operational semantic for well-moded logic programs. In this paper, we study the problem of matching on concurrent traces in the CLF Logical Framework, an extension of LF that supports the specification of concurrent and distributed systems. A concurrent trace is a sequence of computations where independent steps can be permuted. We give a sound and complete algorithm for matching traces with one variable standing for an unknown subtrace. Extending the result to general traces and to unification is left to future work.
-
A hybrid Logical Framework
2009Co-Authors: Frank Pfenning, Jason ReedAbstract:The Logical Framework LF is a constructive type theory of dependent functions that can elegantly encode many other Logical systems. Prior work has studied the benefits of extending it to the linear Logical Framework LLF, for the incorporation linear logic features into the type theory affords good representations of state change. We describe and argue for the usefulness of an extension of LF by features inspired by hybrid logic, which has several benefits. For one, it shows how linear logic features can be decomposed into primitive operations manipulating abstract resource labels. More importantly, it makes it possible to realize a metaLogical Framework capable of reasoning about stateful deductive systems encoded in the style familiar front prior work with LLF, taking advantage of familiar methodologies used for metatheoretic reasoning in LF.
-
A Concurrent Logical Framework: The propositional fragment
Lecture Notes in Computer Science, 2004Co-Authors: Kevin Watkins, Frank Pfenning, Iliano Cervesato, David WalkerAbstract:We present the propositional fragment CLF 0 of the Concurrent Logical Framework (CLF). CLF extends the Linear Logical Framework to allow the natural representation of concurrent computations in an object language. The underlying type theory uses monadic types to segregate values from computations. This separation leads to a tractable notion of definitional equality that identifies computations differing only in the order of execution of independent steps. From a Logical point of view our type theory can be seen as a novel combination of lax logic and dual intuitionistic linear logic. An encoding of a small Petri net exemplifies the representation methodology, which can be summarized as concurrent computations as monadic expressions.
-
TYPES - A concurrent Logical Framework: The propositional fragment
Lecture Notes in Computer Science, 2004Co-Authors: Kevin Watkins, Frank Pfenning, Iliano Cervesato, David WalkerAbstract:We present the propositional fragment CLF0 of the Concurrent Logical Framework (CLF). CLF extends the Linear Logical Framework to allow the natural representation of concurrent computations in an object language. The underlying type theory uses monadic types to segregate values from computations. This separation leads to a tractable notion of definitional equality that identifies computations differing only in the order of execution of independent steps. From a Logical point of view our type theory can be seen as a novel combination of lax logic and dual intuitionistic linear logic. An encoding of a small Petri net exemplifies the representation methodology, which can be summarized as “concurrent computations as monadic expressions”.
Ulf Norell - One of the best experts on this subject based on the ideXlab platform.
-
connecting a Logical Framework to a first order logic prover
Frontiers of Combining Systems, 2005Co-Authors: Andreas Abel, Thierry Coquand, Ulf NorellAbstract:We present one way of combining a Logical Framework and first-order logic. The Logical Framework is used as an interface to a first-order theorem prover. Its main purpose is to keep track of the structure of the proof and to deal with the high level steps, for instance, induction. The steps that involve purely propositional or simple first-order reasoning are left to a first-order resolution prover (the system Gandalf in our prototype). The correctness of this interaction is based on a general meta-theoretic result. One feature is the simplicity of our translation between the Logical Framework and first-order logic, which uses implicit typing. Implementation and case studies are described.
-
FroCoS - Connecting a Logical Framework to a first-order logic prover
Frontiers of Combining Systems, 2005Co-Authors: Andreas Abel, Thierry Coquand, Ulf NorellAbstract:We present one way of combining a Logical Framework and first-order logic. The Logical Framework is used as an interface to a first-order theorem prover. Its main purpose is to keep track of the structure of the proof and to deal with the high level steps, for instance, induction. The steps that involve purely propositional or simple first-order reasoning are left to a first-order resolution prover (the system Gandalf in our prototype). The correctness of this interaction is based on a general meta-theoretic result. One feature is the simplicity of our translation between the Logical Framework and first-order logic, which uses implicit typing. Implementation and case studies are described.
David Walker - One of the best experts on this subject based on the ideXlab platform.
-
A Concurrent Logical Framework: The propositional fragment
Lecture Notes in Computer Science, 2004Co-Authors: Kevin Watkins, Frank Pfenning, Iliano Cervesato, David WalkerAbstract:We present the propositional fragment CLF 0 of the Concurrent Logical Framework (CLF). CLF extends the Linear Logical Framework to allow the natural representation of concurrent computations in an object language. The underlying type theory uses monadic types to segregate values from computations. This separation leads to a tractable notion of definitional equality that identifies computations differing only in the order of execution of independent steps. From a Logical point of view our type theory can be seen as a novel combination of lax logic and dual intuitionistic linear logic. An encoding of a small Petri net exemplifies the representation methodology, which can be summarized as concurrent computations as monadic expressions.
-
TYPES - A concurrent Logical Framework: The propositional fragment
Lecture Notes in Computer Science, 2004Co-Authors: Kevin Watkins, Frank Pfenning, Iliano Cervesato, David WalkerAbstract:We present the propositional fragment CLF0 of the Concurrent Logical Framework (CLF). CLF extends the Linear Logical Framework to allow the natural representation of concurrent computations in an object language. The underlying type theory uses monadic types to segregate values from computations. This separation leads to a tractable notion of definitional equality that identifies computations differing only in the order of execution of independent steps. From a Logical point of view our type theory can be seen as a novel combination of lax logic and dual intuitionistic linear logic. An encoding of a small Petri net exemplifies the representation methodology, which can be summarized as “concurrent computations as monadic expressions”.
-
CLF: A Dependent Logical Framework for Concurrent Computations∗
2004Co-Authors: Kevin Watkins, Frank Pfenning, Iliano Cervesato, David WalkerAbstract:We present CLF, a dependently typed Logical Framework with several novel features supporting concurrent computations, in particular monads and synchronous linear connectives. We illustrate its representation methodology of concurrent computations as monadic expressions via the encoding of an asynchronous π-calculus with correspondence assertions, including its dynamic semantics, safety criterion, and a type system with latent effects due to Gordon and Jeffrey. We also explain a new, general methodology for defining dependently-typed Logical Frameworks in the LF family. The methodology involves defining the terms of the Framework directly in canonical form and greatly simplifies much of the metatheory of these Frameworks, which has been notoriously difficult in the past. We have used the methodology to show that CLF has a number of key properties including decidability of type checking.
-
A Concurrent Logical Framework II: Examples and Applications
2003Co-Authors: Iliano Cervesato, Frank Pfenning, David Walker, Kevin WatkinsAbstract:Abstract : CLF is a new Logical Framework with an intrinsic notion of concurrency. It is designed as a conservative extension of the linear Logical Framework LLF with the synchronous connectives (circle multiply, 1 !, and there exists) of intuitionistic linear logic, encapsulated in a monad. LLF is itself a conservative extension of LF with the asynchronous connectives (Logical negation, & and T). In this report, the second of two technical reports describing CLF, we illustrate the expressive power of the Framework by encoding several different concurrent languages including both the synchronous and asynchronous pi-calculus, an ML-like language with futures, lazy evaluation and concurrency primitives in the style of CML, Petri nets and finally, the security protocol specification language MSR. Throughout the report we assume the reader is already familiar with the formal definition of CLF. For detailed explanation and development of the type theory, please see A Concurrent Logical Framework I: Judgments and Properties WCPW02.
-
A concurrent Logical Framework I: Judgments and properties
2003Co-Authors: Kevin Watkins, Frank Pfenning, Iliano Cervesato, David WalkerAbstract:Abstract : The Concurrent Logical Framework, or CLF, is a new Logical Framework in which concurrent computations can be represented as monadic objects, for which there is an intrinsic notion of concurrency. It is designed as a conservative extension of the linear Logical Framework LLF with the synchronous connectives (circle multiply, 1, !, and there exists) of intuitionistic linear logic, encapsulated in a monad. LLF is itself a conservative extension of LF with the asynchronous connectives (Logical negation, & and T). The present report, the first of two technical reports describing CLF, presents the frame- work itself and its metatheory. A novel, algorithmic formulation of the underlying type theory concentrating on canonical forms leads to a simple notion of definitional equality for concurrent computations in which the order of independent steps cannot be distinguished. The new formulation of the Framework constitutes an original contribution even for the LF fragment. For many additional examples illustrating the use of the Framework to specify and reason about object systems of interest, the reader is referred to the companion technical report on applications CPWW02.
Prasanta Kumar Dey - One of the best experts on this subject based on the ideXlab platform.
-
continuous quality improvement in a maltese hospital using Logical Framework analysis
Journal of Health Organisation and Management, 2016Co-Authors: Sandra C Buttigieg, Dorothy Gauci, Prasanta Kumar DeyAbstract:Purpose: The purpose of this paper is to present the application of Logical Framework analysis (LFA) for implementing continuous quality improvement (CQI) across multiple settings in a tertiary care hospital. Design/methodology/approach: This study adopts a multiple case study approach. LFA is implemented within three diverse settings, namely, intensive care unit, surgical ward, and acute in-patient psychiatric ward. First, problem trees are developed in order to determine the root causes of quality issues, specific to the three settings. Second, objective trees are formed suggesting solutions to the quality issues. Third, project plan template using Logical Framework (LOGFRAME) is created for each setting. Findings: This study shows substantial improvement in quality across the three settings. LFA proved to be effective to analyse quality issues and suggest improvement measures objectively. Research limitations/implications: This paper applies LFA in specific, albeit, diverse settings in one hospital. For validation purposes, it would be ideal to analyse in other settings within the same hospital, as well as in several hospitals. It also adopts a bottom-up approach when this can be triangulated with other sources of data. Practical implications: LFA enables top management to obtain an integrated view of performance. It also provides a basis for further quantitative research on quality management through the identification of key performance indicators and facilitates the development of a business case for improvement. Originality/value: LFA is a novel approach for the implementation of CQI programs. Although LFA has been used extensively for project development to source funds from development banks, its application in quality improvement within healthcare projects is scant.
