Roderick Moten. Exploiting parallelism in interactive theorem provers. In J. Grundy and M. Newey, editors, Proceedings of TPHOLs, volume 1479 of LNCS, pages 315--330. Springer Verlag, 1998. 34 Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
A Taxonomy of Parallel Strategies for Deduction - Bonacina (1999) (Correct)
....search. Both dichotomies did not appear in [21] Second, since approaches based on parallel search modify the sequential notion of search plan, it proposes formal definitions of multi search plan and distributed search plan that match the surveyed strategies. Third, it covers many papers (e.g. [1, 31, 30, 42, 40, 52, 55, 57, 65, 72, 74, 83, 91, 93, 95, 99, 102, 104]) that have appeared since [21] was written in 1992, o#ering an up to date survey of the field. Last, the analysis in [21] emphasized the di#culty of parallelizing contraction based strategies, and was more optimistic on the parallelization of subgoal reduction strategies. After eight years of ....
....[95, 55] This study is dedicated to parallel fully automated theorem proving, and does not cover other subfields of automated deduction, such as interactive proof assistants and model generation systems. It is important, however, that parallelism has been applied also in those domains, e.g. [95, 83, 65] for the former and [58, 64, 104] for the latter. We also refer to [67, 66] for the 24 oriented contractionbased parallelism at the term level parallel matching parallel rewriting parallelism at the clause level AND parallelism inferences parallelism at the search level parallel ....
Roderick Moten. Exploiting parallelism in interactive theorem provers. In J. Grundy and M. Newey, editors, Proceedings of TPHOLs, volume 1479 of LNCS, pages 315--330. Springer Verlag, 1998. 34
JaLoF: A Development Environment for Deduction Systems - Moten (1999) Self-citation (Moten) (Correct)
....building reasoning system for the Nuprl type theory [1] With the Nuprl PDS, we can develop reasoning systems for logics without encoding them into the Nuprl type theory. We discovered this feature of the Nuprl PDS when re implementing Nuprl to exploit parallelism on a shared memory multiprocessor [7, 6]. Jason Hickey has recently developed an architecture for the Nuprl PDS, MetaPRL [4] to exploit the independence of the Nuprl PDS from the Nuprl Type Theory. The Nuprl PDS contains an untyped abstract syntax, the Nuprl term language, that is used to encode the Nuprl type theory. Although the ....
Roderick Moten. Exploiting parallelism in interactive theorem provers. In Proceedings of the Eleventh International Conference, TPHOLs 98, number 1479 in Lecture Notes In Computer Science, pages 315-330, 1998.
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