Jonas Barklund and Hakan Millroth. Integrating complex data structures in Prolog. In Symposium on Logic Programming, pages 415--425, San Francisco, August 1987. IEEE Computer Society. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Our LIPS Are Sealed: Interfacing Logic and Functional.. - Lindstrom.. (1992) (Correct)
....static typing is lovely until one undertakes system programming. 15 Related Work In addition to the S unification work mentioned earlier, the freeze thaw notions in sequential implementations such as Mu Prolog, and representative approaches to narrowing, are relevant. Barklund and Millroth [BM87] discuss dealing with alien ( hairy ) data structures in Prolog; their techniques bear some similarity with our sealed envelopes. A sound treatment of dynamic typing in an extension of SML is described in [ACPP89] Our type union is very similar to their type dynamic; however, we also consider ....
Jonas Barklund and Hakan Millroth. Integrating complex data structures in Prolog. In Symposium on Logic Programming, pages 415--425, San Francisco, August 1987. IEEE Computer Society.
Data-parallel Implementation of Prolog - Bevemyr (1996) (Correct)
....the predefined ternary arg relation. In our earlier research, we investigated how arrays, tables and other data structures could be incorporated into Prolog by making them obey the rules above in such a way that they were denoted by terms of a fixed arity, in the same way as for lists and trees [25]. The reason was that we wanted to be able to use recursion also for traversing and constructing arrays, tables, etc. We have abandoned that effort and propose instead to use bounded quantification for this purpose, in accordance with the discussion at the beginning of this section. The syntax for ....
J. Barklund, H. Millroth, Integrating Complex Data Structures in Prolog, Proc. 1987 Symp. Logic Programming, IEEE, 1987. --105
Prolog with Arrays and Bounded Quantifications - Barklund, Bevemyr (1993) (7 citations) Self-citation (Barklund) (Correct)
....the predefined ternary arg relation. In our earlier research, we investigated how arrays, tables and other data structures could be incorporated into Prolog by making them obey the rules above in such a way that they were denoted by terms of a fixed arity, in the same way as lists and trees are [5]. The reason was that we wanted to be able to use recursion also for traversing and constructing arrays, tables, etc. We have abandoned that effort and propose instead to use bounded quantification for this purpose, in accordance with the discussion at the beginning of this section. The syntax for ....
Barklund, J. and Millroth, H., Integrating Complex Data Structures in Prolog, in: S. Haridi (ed.), Proc. 1987 Symp. on Logic Programming, Comp. Soc. Press of the IEEE, Washington, D.C., 1987.
Tabulation of Functions in Definite Clause Programs - Barklund (1994) (2 citations) Self-citation (Barklund) (Correct)
....clause programs. It is also worth mentioning that the ideas described above for using efficient data structures for tabulation of certain kinds of functions can be seen as an alternative to the methods for introducing complex data structures in logic programming proposed earlier by us and others [2, 3, 12]. Finally, a predicate denoting a function having a contiguous integer range as domain and that therefore can be tabulated using a function has an interesting similarity with the lazy array comprehensions of Haskell [17] a data structure for which there is a procedure that can compute the ....
Barklund, J. and Millroth, H., Integrating Complex Data Structures in Prolog, in: S. Haridi (ed.), Proc. 1987 Symp. on Logic Programming, IEEE Computer Society Press, Washington, D.C., 1987.
Hash Tables in Logic Programming - Barklund, Millroth (1987) Self-citation (Barklund Millroth) (Correct)
....containing fK 1 V 1 ; K 2 V 2 ; Kn Vn g where 8ifK i K i 1 g would be represented by a term ht(K 1 ,V 1 ,ht(K 2 ,V 2 , Since we use reserved functors the tables will not unify with any other terms. With this representation the syntactic unification condition holds. Barklund Millroth B] investigates further methods of fully integrating MVDS and other internally complicated data structures as ordinary Prolog terms with syntax, unification etc. 3.1 Primitive Predicates empty hash table(Table) Table is unified with an empty hash table. This is used to create a hash table or to ....
J. Barklund, H. Millroth, Integrating Complex Data Structures in Prolog, forthcoming.
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