J.A. Robinson: A Machine Oriented Logic Based on the Resolution Principle, Journal of the ACM, 12(1), 1965.  Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Basic Polymorphic Typechecking - Cardelli (1988) (56 citations) (Correct)
....Whenever an occurrence of a type variable is instantiated, all the other occurrences of the same variable must be instantiated to the same value: legal instantiations of a a are int int, bool bool, b g) b g) etc. This contextual instantiation process is performed by unification, Robinson 65] and is at the basis of polymorphic typechecking. Unification fails when trying to match two different type operators (like int and bool) or when trying to instantiate a variable to a term containing that variable (like a and a b, where a circular structure would be built) The latter situation ....
J.A.Robinson: A machine-oriented logic based on the resolution principle, Journal of the ACM, Vol 12, No. 1, Jan 1965, pp. 23-49.
Behaviour Analysis for Validating Communication Patterns - Amtoft, Nielson, Nielson (1997) (Correct)
....Algorithm We shall aim at constructing a type reconstruction algorithm in the spirit of Milner s algorithm W [13] given an expression e and an environment A, the recursively defined function W will produce a substitution S, a type t, and a behaviour b. The definition in [13] employs unification [27]: if e i has been given type t i (for i = 0; 1; 2) then in order to type if e 0 then e 1 else e 2 one must unify t 0 with bool and t 1 with t 2 . Unification works by decomposition: in order to unify t 1 t 2 and t 0 1 t 0 2 one recursively unifies t 1 Torben Amtoft et al. Behaviour ....
J.A. Robinson: A machine-oriented logic based on the resolution principle. Journal of the ACM, 12:23--41, 1965.
Extending Decidable Clause Classes via Constraints - Pichler (Correct)
....a resolvent is derived via n 1 cRes x rule applications. The above calculus I x differs from the original definition of Caferra et al. in various ways (cf. CZ 91] Analogously to Robinson s original definition of resolution, we consider factoring and resolution as a single inference step (cf. Rob 65] More importantly, we apply the unifying substitution oe explicitly both to the clause part and to the constraint part whereas, in [CZ 91] the unification is carried out implicitly by adding the corresponding equations s i = t i to the constraints. Furthermore, the definition of ....
J.A.Robinson: A machine oriented logic based on the resolution principle, Journal of the ACM, Vol 12, No 1, pp. 23- 41 (1965).
Behaviour Analysis for Validating Communication Patterns - Amtoft, Nielson, Nielson (1997) (Correct)
....Algorithm We shall aim at constructing a type reconstruction algorithm in the spirit of Milner s algorithm W [12] given an expression e and an environment A, the recursively defined function W will produce a substitution S, a type t, and a behaviour b. The definition in [12] employs unification [23]: if e i has been given type t i (for i = 0; 1; 2) then in order to type if e 0 then e 1 else e 2 one must unify t 0 with bool and t 1 with t 2 . Unification works by decomposition: in order to unify t 1 t 2 and t 0 1 t 0 2 one recursively unifies t 1 with t 0 1 and t 2 with t 0 2 ; ....
J.A. Robinson: A machine-oriented logic based on the resolution principle. Journal of the ACM, 12:23--41, 1965.
On Understanding Types, Data Abstraction, and Polymorphism - Cardelli, Wegner (1985) (90 citations) (Correct)
....In x 1 above, x would initially have type a, where a is a new type variable (a new type variable is introduced for every program variable) Then the Int operator would retroactively force a to be equivalent to Int. This instantiation of type variables is done by Robinson s unification algorithm [Robinson 65] which also takes care of propagating information across all the instances of the same variable, so that incompatible uses of the same variable are detected. An introductory exposition of polymorphic type inference can be found in [Cardelli 84a] This inference algorithm is not limited to ....
J.A.Robinson: A machine-oriented logic based on the resolution principle, Journal of the ACM, vol. 12, no. 1, Jan. 1956, pp. 23-49.
Multiple OR-Parallel Resolution: Meta-Level Control of.. - Kefalas, Vlahavas Self-citation (Logic) (Correct)
....of goals in the body of a clause is resolved in parallel) Recent implementations show that parallel execution of logic programs can result into efficiently speeding up their execution [2, 3] 1. 1 The Resolution Principle of Prolog Prolog uses LUSH resolution [4] a kind of SLD resolution [5], which involves chronological backtracking in order to explore alternatives. LUSH resolution inherits efficiency but also incompleteness from depth first search. A conjunction of subgoals A 1 ,A 2 , A q which remain to solve the initial goal (query) is called resolvent. A query is solved if ....
J.A. Robinson: A Machine-Oriented Logic Based on the Resolution Principle, Journal of the ACM, 12:1, 23-41 (1965).
Modeling and Querying Web Data: A Constraint-Based Logic.. - Terzi, Hacid, Vakali (2003) (Correct)
No context found.
J.A. Robinson: A Machine Oriented Logic Based on the Resolution Principle, Journal of the ACM, 12(1), 1965.
Modeling and Querying Web Data: A Constraint-Based Logic.. - Terzi, Hacid, Vakali (2003) (Correct)
No context found.
J.A. Robinson: A Machine Oriented Logic Based on the Resolution Principle, Journal of the ACM, 12(1), 1965.
Behaviour Analysis for Validating Communication Patterns - Amtoft, Nielson, Nielson (1998) (Correct)
No context found.
J.A. Robinson: A machine-oriented logic based on the resolution principle. Journal of the ACM, 12:23--41, 1965.
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