M.Gorden, R.Milner and C.Wadsworth, Edinburgh LCF: A Mechanised logic of computation, Lecture Notes in Computer Science Number 78, Springer-Verlag, 1979. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Towards Proof Planning for ... - Schürmann, Autexier (2002) (Correct)
....The di#culty and sheer complexity of automated deduction tasks are so daunting that implementers of many interactive theorem proving systems such as Isabelle [Pau94] Coq [DFH 93] Lego [LP92] PVS [ORS92] and INKA [Hut96] prove lemmas and theorems with heuristics based techniques. Tactics [GW79] for example, heuristically explore the search space until no more progress can be made, and proof planning techniques [Bun88] heuristically plan a path through the search space of states to guide proof search. The degree and the success of automation that one can expect from a theorem proving ....
Milner A. J. Gordon, M. J. and C. P. Wadsworth. Edinburgh LCF:A Mechanised Logic of Computation. LNCS 78. Springer-Verlag, 1979.
Towards a New Way of Parameterization - Grosu, Nazareth (1994) (3 citations) (Correct)
....in Section 6. Finally in Section 7 we draw some conclusions and point out some future work. 2 The Specification Language Spectrum Spectrum is an axiomatic specification language which borrows concepts both from algebraic languages (e.g. LARCH [9] and from type theoretic languages (e.g. LCF [20]) An informal presentation with many examples illustrating its properties is given in [1] We briefly summarize its principal characteristics. As in algebraic specification languages, a Spectrum specification consists of a signature and an axioms part. However, in contrast to most algebraic ....
C. Wadsworth, M. Gordon, and R. Milner. Edinburgh lcf: A mechanised logic of computation. In LNCS 78. Springer, 1979. 10
The Semantics of SPECTRUM - Grosu, Regensburger (1994) (3 citations) (Correct)
....illustrating its properties is given in [2, 3] The purpose of this article is to describe its formal semantics. 1 Introduction The Spectrum specification language is axiomatic and borrows concepts both from algebraic languages (e.g. LARCH [12] as well as from type theoretic languages (e.g. LCF [4]) An informal presentation with many examples illustrating its properties is given in [2, 3] We briefly summarize its principal characteristics. Influences from algebra. In Spectrum specifications the influence of algebraic techniques is evident. Every specification consists of a signature and ....
R. Milner C Wadsworth M. Gordon. Edinburgh LCF: A Mechanised Logic of Computation, volume 78 of LNCS. Springer, 1979.
Theorem Provers of LCF - Larson (1997) (Correct)
....3. We then give an overview of other theorem provers in this category, explaining their own unique features and giving a comparision with HOL 4 1 2 Basics of LCF and the LCF style Logic of Computable Functions (LCF) is a theorem prover for reasoning about properties of computable functions [MJGW79] Created by Gordon and Milner in the mid 1970s, it was one of the first theorem provers. Many modern provers have copied its architecture, commonly called the LCF style . What is the LCF style As mentioned earlier, an integral part of theorem provers is the inference engine. The integrity of ....
Arthur J. Milner Michael J. Gordon and Christopher P. Wadsworth. Edinburgh LCF: A Mechanised Logic of Computation, volume 78 of Lecture Notes in Computer Science. Springer-Verlag, 1979.
Analytica - A Theorem Prover for Mathematica - Clarke, Zhao (1993) (32 citations) (Correct)
....that of Quaife [16] His work, however, uses a theorem prover based on hyper resolution and may not produce proofs that are very readable. Better methods for managing hypotheses and previously proved lemmas and theorems are also needed. Techniques developed for proof checking systems like LCF [13] and HOL [12] may be adequate in the short run, but some type of higher order unification or matching will probably be necessary in the majority of cases. In general, deciding when to use an hypothesis or previous result is a very difficult problem. Every student of elementary calculus learns the ....
M.Gorden, R.Milner and C.Wadsworth, Edinburgh LCF: A Mechanised logic of computation, Lecture Notes in Computer Science Number 78, Springer-Verlag, 1979.
The Logical Framework of SPECTRUM - Grosu, Regensburger (1994) (2 citations) (Correct)
....: 35 3. 2 Acknowledgement : 35 Chapter 1 Introduction The Spectrum specification language is axiomatic and borrows concepts both from algebraic languages (e.g. LARCH [GHW85] as well as from type theoretic languages (e.g. LCF [CWMG79] An informal presentation with many examples illustrating its properties is given in [BFG 93a, BFG 93b] We briefly summarize its principal characteristics. 1.1 Influences from algebra In Spectrum specifications the influence of algebraic techniques is evident. Every specification ....
R. Milner C Wadsworth M. Gordon. Edinburgh LCF: A Mechanised Logic of Computation, volume 78 of LNCS. Springer, 1979.
Analytica - An Experiment in Combining Theorem Proving and.. - Clarke, Zhao (1992) (6 citations) (Correct)
No context found.
M.Gorden, R.Milner and C.Wadsworth, Edinburgh LCF: A Mechanised logic of computation, Lecture Notes in Computer Science Number 78, Springer-Verlag, 1979.
The Semantics of Spectrum - Radu Grosu And (1994) (3 citations) (Correct)
No context found.
R. Milner C Wadsworth M. Gordon. Edinburgh LCF: A MechanisedLogic of Computation, volume 78 of LNCS. Springer, 1979.
The Logical Framework of - Radu Grosu Franz (Correct)
No context found.
R. Milner C Wadsworth M. Gordon. Edinburgh LCF: A MechanisedLogic of Computation,volume 78 of LNCS. Springer, 1979.
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