Pym, D. and L. Wallen, Proof-search in the -calculus, in \Logical Frameworks", Huet, G. and G. Plotkin, editors, Cambridge University Press, 1991, 309-340. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
Notes Towards a Semantics for Proof-search - Pym Self-citation (Pym) (Correct)
....all is not lost. A simple reordering, or permutation, of the reductions of the quanti ers yields the following search tree: 10 p(a; b) p(a; b) 9R p(a; b) 9u:p(u; b) 8L 8y:p(a; y) 9u:p(u; b) 8R 8y:p(a; y) 8v:9u:p(u; v) 9L 9x:8y:p(x; y) 8v:9u:p(u; v) 2) As shown in [35,28], the existence of the latter search can be calculated from the former via the technology of reduction orderings. Such an ordering, which compares the structure of formul and substitutions with the structure of the search tree, induces an equality on searches which should be respected in the ....
Pym, D. and L. Wallen, Proof-search in the -calculus, in \Logical Frameworks", Huet, G. and G. Plotkin, editors, Cambridge University Press, 1991, 309-340.
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