Abstract
In this report, I describe an experience in using PaiLisp, a parallel implementation of Scheme, for a reasonably large application in symbolic computation. The application is higher-order unification in a typed λ-calculus, where a unification procedure solves equations containing unknown variables ranging over functions. For a large and balanced unification problem, I could gain almost linear speed-up up to the maximum number of processors.
Preview
Unable to display preview. Download preview PDF.
References
Elliott, C. M.: Some extensions and applications of higher-order unification, Ph.D Thesis, School of Computer Science, Carnegie Mellon University, 1990.
Snyder, W., Gallier, J.: Higher-order unification revisited: Complete sets of transformations, Journal of Symbolic Computation, Vol. 8, Nos 1&2 (1989), pp. 101–140.
Hagiya, M.: Programming by example and proving by example using higher-order unification, 10th International Conference on Automated Deduction (Stickel,M., ed.), Lecture Notes in Artificial Intelligence, Vol.449 (1990), pp.588–602.
Hagiya, M.: ¿From programming-by-example to proving-by-example, Theoretical Aspects of Computer Software (Ito, T., Meyer, A. R., eds.), Lecture Notes in Computer Science, Vol.526 (1991), pp.387–419.
Hagiya, M.: Higher-order unification as a theorem proving procedure, Eighth International Conference on Logic Programming, 1991, pp.270–284.
Huet, G. P.: A unification algorithm for typed λ-calculus, Theoretical Computer Science, Vol. 1 (1975), pp. 27–57.
Ito. T., Matsui, M.: A parallel Lisp language PaiLisp and its kernel specification, Parallel Lisp: Languages and Systems, (Ito, T., Halstead, R. H. Jr., eds.), Lecture Notes in Computer Science, Vol.441 (1990), pp.58–100.
Pym, D.: Proofs, search and computation in general logic, Ph.D Thesis, Department of Computer Science, University of Edinburgh, CST-69-90, 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hagiya, M. (1993). Running higher-order unification in PaiLisp. In: Halstead, R.H., Ito, T. (eds) Parallel Symbolic Computing: Languages, Systems, and Applications. PSC 1992. Lecture Notes in Computer Science, vol 748. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0018651
Download citation
DOI: https://doi.org/10.1007/BFb0018651
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57396-8
Online ISBN: 978-3-540-48133-1
eBook Packages: Springer Book Archive