Feliks Kluzniak. Type synthesis for Ground Prolog. In Proceedings of the Fourth International Conference on Logic Programming, pages 788--816. MIT Press, 1987.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....program executions, whereas we are interested in using modes to prescribe program execution order, and insist that the compiler must have exact information about instantiation states. The only other mode analysis systems that do likewise work with much simpler domains (for example, Ground Prolog [9] recognizes only two instantiation states, free and ground) Other related work has been on mode checking for concurrent logic programming languages and for logic programming languages with coroutining [1, 5, 7] there the emphasis has been on detecting communication patterns and possible ....

F. Kluzniak. Type synthesis for ground Prolog. In Procs. of ICLP87. 788--816, MIT Press, 1987.

....x, y, or both representing an object skolem constant. For an event calculus program, this can easily be achieved by a normalization procedure which transforms the domain clauses into equivalent clauses that make unifications explicit using = 2 literals in the body of the clauses [Bruynooghe 86, Kluzniak 87] Since object skolem constants are represented by Prolog variables, every inequality in Deltas 6= can be written as (X 6= y) with X a Prolog variable and y a term distinct from X. Deltas 6= explicitly represents the symmetric relationship of the inequalities of the form X 6= Y , in which X ....

Feliks Kluzniak. Type synthesis for ground prolog. In J.-L. Lassez, editor, Proceedings of the 4th International Conference on Logic Programming, Melbourne, 1987, pages 788-- 816. The MIT Press, 1987.

.... write programs without having to define or mention types; rather, the compiler automatically infers types and checks for type correctness [Red88] Given that recognition in the benefit of type checking, the design of type systems for logic programming languages has been studied extensively (cf. [Klu87, Mis84, MO83, Red88, XW88, Zob87]) The basis for descriptive type systems for logic programs was proposed by Mishra [Mis84] a formula that fails may be considered erroneous. Thus, the type of a predicate describes all the terms for which the predicate may succeed. Such types can be called optimistic types [Red88] A type of a ....

F. Kluzniak. Type synthesis for ground Prolog. In Proc. 4th International Conference on Logic Programming, pages 788--816, Melbourne, Australia, May 1987. MIT Press.

....final instantiation state is the responsibility of this predicate. The most common instantiation states are free and ground. The mode in maps ground to ground, while the mode out maps free to ground. These two modes suffice for the vast majority of predicates in many real programs (see e.g. [6, 11], and compare the in out annotations on the parameters of procedures in Ada) Mercury, however, also allows programmers to define new instantiation states based on the structures of types. These are required for operations on partially instantiated data structures, e.g. using one predicate to ....

F. Kluzniak. Type synthesis for ground Prolog. In Proceedings of the Fourth International Conference on Logic Programming, pages 788--816, Melbourne, Australia, June 1987.

.... the predicate) we indicate such construction unifications as Y : f(X 1 , Xn) ffl instances of Y = f(X 1 , Xn) where Y is input and the X i are output or void; we indicate such deconstruction unifications as Y = f(X 1 , Xn) These classifications are similar to the ones used in [16]. For other instances of unification we call an out of line procedure whose code is automatically generated from the type of the arguments. For example, to test whether two lists are equal we call a predicate such as unifylistt(A, B) A = B = unifylistt(A, B) A = AH AT] B = ....

F. Kluzniak. Type synthesis for ground Prolog. In Proceedings of the Fourth International Conference on Logic Programming, pages 788--816, Melbourne, Australia, June 1987.

....final instantiation state is the responsibility of this predicate. The most common instantiation states are free and ground. The mode in maps ground to ground, while the mode out maps free to ground. These two modes suffice for the vast majority of predicates in many real programs (see e.g. [11, 19, 22], and compare the in out annotations on the parameters of procedures in Ada) Mercury, however, also allows programmers to define new instantiation states based on the structures of types [35] These are required for operations on partially instantiated data structures, e.g. using one predicate to ....

F. Kluzniak. Type synthesis for Ground Prolog. In Proceedings of the Fourth International Conference on Logic Programming, pages 788--816, Melbourne, Australia, June 1987.

No context found.

Feliks Kluzniak. Type synthesis for Ground Prolog. In Proceedings of the Fourth International Conference on Logic Programming, pages 788--816. MIT Press, 1987.

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