Miller, D. (1991) Unication of simply typed lamda-terms as logic programming. In Furukawa, K. (ed.), Logic Programming, Proceedings of the Eighth International Conference, Paris, pp. 255-269. MIT Press.  Home/Search   Document Not in Database   Summary   Related Articles

....variable bindings. For example there is no doubt about the matching of 8x: Px to 8n: n n 1, whereas with the bound variables removed one could have various alternatives, e.g. P = x: n x 1 and x = n. Our allowable patterns correspond quite closely to higher order patterns, for which Miller (1991) proved even the uni cation (two way matching) problem to be decidable and deterministic ( unitary ) We generalize higher order patterns in two ways. First, one need not simply have variables in the patterns, but can have arbitrary terms involving only these resolvable variables. Thus one can ....

Miller, D. (1991) Unication of simply typed lamda-terms as logic programming. In Furukawa, K. (ed.), Logic Programming, Proceedings of the Eighth International Conference, Paris, pp. 255-269. MIT Press.

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