7 citations found. Retrieving documents...
Avron, Arnon, Honsell, Furio, & Mason, Ian A. (1989). An overview of the Edinburgh Logical Framework. Birtwistle, Graham, & Subrahmanyam, P.A. (eds), Current trends in hardware verification. Springer Verlag.

 Home/Search   Document Details and Download   Summary   Related Articles   Check  

This paper is cited in the following contexts:
Algorithm-Independent Framework for Verifying Integer Constraints - Teller, Shao (2000)   (1 citation)  (Correct)

....algorithm may be Omega2FOL, Simplex2FOL, 2FOL. Or Twelf [13] or Coq [4] or the user himself. And the algorithm does not have to be trusted. This is one of the next steps in the evolution of Solver2FOL. 7. 2 Twelf We have begun working on integration using the Edinburgh Logical Framework (LF) [2] through Twelf. In other words, we are trying to encode the whole Solver2FOL system into LF and to translate proofs into the Twelf system. This task has been undertaken with the support of Princeton s PCC team, using PCC team s meta logic for Twelf. Using some meta language (such as LF) and some ....

A. Avron, F. Honsell, and I. Mason. An overview of the edinburgh logical framework, 1989.


Algorithm-Independent Framework for Verifying Integer Constraints - Teller, Shao (2000)   (1 citation)  (Correct)

....algorithm may be Omega2FOL, Simplex2FOL, 2FOL. Or Twelf [12] or Coq [4] or the user himself. And the algorithm does not have to be trusted. This is one of the next steps in the evolution of Solver2FOL. 7. 2 Twelf We have begun working on integration using the Edinburgh Logical Framework (LF) [2] through Twelf. In other words, we are trying to encode the whole Solver2FOL system into LF and to translate proofs into the Twelf system. This task has been undertaken with the support of Princeton s PCC team, using PCC team s meta logic for Twelf. Using some meta language (such as LF) and some ....

A. Avron, F. Honsell, and I. Mason. An overview of the edinburgh logical framework, 1989.


Providing User-Oriented Support for Software Development by.. - Cheng, Han, al. (1992)   (Correct)

....and theorem proving have been developed to investigate computeraided support for formal methods. These include: HDM [17] EHDM [16] Gypsy [9] Affirm [8, 12, 13] EVES [7] several assistants for the refinement calculus [4, 18, 2] Mural [11] RAISE [14] B [19] Demo2 [15] HOL [10] LF [1], and Nuprl [6] Most of these tools concentrate on the semantic checking and calculation involved in the development steps. Limited attention is given to systematic support for the development process. To capture the relationships between its components, there is a need to record the development ....

....equivalence being employed, and goal to achieve. fol (window 1,theorem top level) trans(def( Expand the definition of = using = and and . focus: not (not #A) #A) and (#A = not (not #A) Equivalence: Goal: true fol (window 1,theorem top level) openwin([1,1,1]) Concentrate on the 1st conjunct. Open a window on the 1st not #A . focus: not #A 2: not #A Hypotheses deduced by Demo2 from the 1: #A = not (not #A) previous focus. Note that hypothesis 2 Equivalence: Goal: true is an immediate match for the focus. fol (window 2,theorem) ....

[Article contains additional citation context not shown here]

A. Avron, F. Honsell, and I.A. Mason. An overview of the Edinburgh logical framework. In G. Birtwistle and P.A. Subrahmanyam, editors, Current Trends in Hardware Verification and Automated Theorem Proving, pages 323--340. Springer-Verlag, New York, 1989.


A Framework for Defining Logics - Harper, Honsell, Plotkin (1987)   (380 citations)  Self-citation (Honsell)   (Correct)

....be represented in this way; for object logics with non standard variable binding other means are necessary. In particular, one can use the notion of judgement (explained in the next section) to enforce context dependent conditions that are not directly expressible using the LF type system. See [4, 3] for examples. It should be noted that since the LF type system is considerably richer than the system of arities, it is correspondingly better able to provide a natural representation of syntax (see, for example, the encoding of higher order logic given below) In this section we consider the ....

....Since this research was initiated, there has been further work conducted both by members of the LF project and elsewhere. We begin by surveying the work of the LF project. A number of example logical systems have been encoded in LF. These include two different variations on Hoare logic [4] [3], modal logics from K to S4 [4] various calculi, including I, v , and linear calculus [4] 3] various type theories, including the LF type system itself, Martin Lof s type theory, and the Damas Milner type assignment system [22] A natural deduction approach to operational semantics based ....

[Article contains additional citation context not shown here]

Avron, A., Honsell, F., and Mason, I. A. An overview of the Edinburgh logical framework. In Current Trends in Hardware Verification and Automated Theorem Proving, G. Birtwistle and P. A. Subramanyam, Eds. Springer-Verlag, 1989, pp. 323--240.


Using Typed Lambda Calculus to Implement Formal.. - Avron, Honsell.. (1992)   (55 citations)  Self-citation (Avron Honsell)   (Correct)

....in this paper were obtained by the authors in the years 1986 1988 while working at the LF Project at the LFCS in Edinburgh. An early version of this paper (written by the first three authors) circulated in 1987 as an LFCS Technical Report [6] A gentle abridged version of that report appears in [5]. At that time the only implementation of the LF was a version written by Timothy Griffin in the Cornell Synthesizer Generator [23] Since then Robert Pollack implemented the LF in his LEGO system, described by him in the seventh section of this paper. Since this paper was submitted (in 1987) for ....

A.Avron, F.Honsell, and Mason, I. An Overview of the Edinburgh Logical Framework. in: Current Trends in Hardware Verifications and Automated Theorem Proving., Edited by G.Birtwistle and P.A.Subramanyam, Springer-Verlag, 1989.


Inferring the Equivalence of Functional Programs that Mutate Data - Mason, Talcott (1992)   (20 citations)  Self-citation (Mason)   (Correct)

....On the surface this is an infinitary rule. However, in practice the family of equations E are presented in a simple schematic form. In the cases where E is finitely presented, or presented as a schemata, the induction rule (LI) can easily be encoded in, for example, the Edinburgh logical framework [10, 2], or reformulated in the style of Boyer and Moore [4] We give three examples of the usage of the List induction principle. They serve to illustrate the variety of theorems provable. The proofs also provide examples of rather different families of equations. The third example best illustrates the ....

A. Avron, F. Honsell, and I. A. Mason. An overview of the Edinburgh Logical Framework. In G. Birtwistle and P.A. Subrahmanyam, editors, Current Trends in Hardware Verification. Springer Verlag, Heidelberg, 1989.


Mechanizing Language Definitions - Harper, Licata (2006)   (Correct)

No context found.

Avron, Arnon, Honsell, Furio, & Mason, Ian A. (1989). An overview of the Edinburgh Logical Framework. Birtwistle, Graham, & Subrahmanyam, P.A. (eds), Current trends in hardware verification. Springer Verlag.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC