: C.Horn. The NurPRL Proof Development System. Technical Report, Dept. of Artificial Intelligence, University of Edinburgh, March 1988. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
The Specialization and Transformation of Constructive.. - Peter Madden Department (1989) (2 citations) (Correct)
....of programs by transforming their synthesis proofs (section 3) This research is supportedby S.E.R.C. grant GR D 44270, and a studentship to the author. 1 Oyster is the Edinburgh Prolog implementation of NuPRL; version nu of the Proof Refinement Logic system originally developed at Cornell [Horn 88, Constable et al. 86] This research involved developing transformation techniques which increase the efficiency of the original program, the source, by transforming its synthesis proof into one, the target, which yields a computationally more efficient algorithm. This process is known as program ....
: C.Horn. The NurPRL Proof Development System. Technical Report, Dept. of Artificial Intelligence, University of Edinburgh, March 1988.
The Specialization of Constructive Existence Proofs - Peter Madden October (1988) (Correct)
....than the data needed for simple execution . This research is supported by S.E.R.C. grant GR D 44270, and a studentship to the author. 1 Oyster is the Edinburgh Prolog implementation of Nuprl; version nu of the Proof Refinement Logic system originally developed at Cornell [Constable 86, Horn 88] 1 1.2 Contents Section 2 deals with the main motivations for the reconstruction by setting the transformation system in a broader context. Section 3 addresses specialization and pruning and gives a general explanation by example of the upper bound algorithm. Section 4 highlights the ....
: C.Horn. The NurPRL Proof Development System. Technical Report, Dept. of Artificial Intelligence, University of Edinburgh, March 1988.
Proceedings Of The First Workshop On Logical Frameworks.. - G. Huet, G. Plotkin (Eds.) (1990) (Correct)
....languages and then discuss some issues concerning the framework, which lead to another hierarchy of languages, LTC 0 ; LTC 1 ; LTC . The second part of the paper documents the implementation of this last hierarchy in the generic theorem prover, Isabelle, developed by Larry Paulson at Cambridge [4, 5]. We also describe work in progress on verifying, in Isabelle, the interpretations of the type theories TT 0 ; TT 1 and TT , that are presented in [6] in the corresponding languages of the new LTC hierarchy. Part One: The Framework 2 The LTC framework and the languages L i . The increasing ....
....for LTC. In Proceedings of the 3rd Annual Symposium on Logic in Computer Science, pages 392 399. IEEE, 1988. 3] Peter Dybjer and Herbert Sander, A Functional Programming Approach to the Specification and Verification of Concurrent Systems. Formal Aspects of Computing (1989) 1:303 319 [4] L. C. Paulson, The Foundation of a Generic Theorem Prover. Technical report 130, University of Cambridge, 1988. 5] L. C. Paulson and T. Nipkow, Isabelle tutorial and user s manual. Technical report 189, University of Cambridge, 1990. 6] N. Mendler, A series of type theories and their ....
[Article contains additional citation context not shown here]
Horn, C., "The Nurprl Proof Development System", Working Paper 214, Dept. of Artificial Intelligence, Edinburgh, 1988. The Edinburgh version of Nurprl has been renamed Oyster.
Planning for Behaviour-Based Robotic Assembly: A Logical Framework - Cranefield (1990) (Correct)
No context found.
Horn, C. (1988), "The NurPRL Proof Development System", Working Paper 214, Department of Artificial Intelligence, University of Edinburgh.
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