Retrieving library identifiers via equational matching of types

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 449 LNAI, Issue , 1990, Pages 603-617

  Rittri, Mikael ^a  

^a CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

PATTERN MATCHING; SET THEORY; THEOREM PROVING;

CARTESIAN CLOSED CATEGORY; CARTESIAN PRODUCTS; EXPONENTIATIONS; FUNCTION SPACES; LIBRARY SEARCH; PROGRAMMING ENVIRONMENT; SEARCH KEYS; TYPE SYSTEMS;

FUNCTIONAL PROGRAMMING;

EID: 85013271434     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-52885-7_117     Document Type: Conference Paper

References (21)

1. L. Augustsson and T. Johnsson. The Chalmers Lazy-ML compiler. The Computer Journal, 32(2), 1989.
2. F. Fages and G. Huet. Complete sets of unifiers and matchers in equational theories. Theoretical Comp. Sci., 43:189–200, 1986.
3. P. Hancock. A type-checker. In S.L. Peyton Jones, The Implementation of Functional Programming Languages, chapter 9. Prentice-Hall, 1987.
4. J.M. Hullot. Associative commutative pattern matching. In Sixth Int. Joint Conf. on Artificial Intelligence, Tokyo, 1979.
5. B. Lang. Matching with multiplication and exponentiation, May 1978. Author’s current address: INRIA, Domaine de Voluceau, Rocquencourt, B.P. 105, F-78153 Le Chesnay Cedex, France. E-mail: lang@inria.fr
6. G. Longo, A. Asperti, and R. Di Cosmo. Coherence and valid isomorphism in closed categories. In D.H. Pitt et al., eds., Category Theory and Computer Science, Manchester, 1989. LNCS 389, Springer-Verlag.
7. C.F. Martin. Equational Theories of Natural Numbers and Transfinite Ordinals. PhD thesis 1973. University of California, Berkeley, CA 94720, USA. See also Notices of the Am. Math. Soc., 19(7):A-778-779, Abstract 698-E1, 1972.
8. R. Milner. A theory of type polymorphism in programming. J. of Comp. and System Sci., 17(3):348–375, 1978.
9. P. Narendran, F. Pfenning, and R. Statman. On the unification problem for Cartesian closed categories, 1989. Addresses: P. Narendran, State Univ. of New York at Albany, USA. F. Pfenning and R. Statman, Carnegie Mellon Univ., Pittsburgh, USA. E-mail: dran@cssun.albany.edu, fp@cs.cmu.edu, statman@c.cs.cmu.edu
10. G.E. Peterson and M.E. Stickel. Complete sets of reductions for some equational theories. JACM, 28(2):233–264, April 1981.
11. P.W. Purdom Jr. and C.A. Brown. Fast many-to-one matching algorithms. In J.-P. Jouannaud, ed., Rewriting Techniques and Applications, Dijon, France, 1985. LNCS 202, Springer-Verlag.
12. C. Reade. Elements of Functional Programming. Addison-Wesley, 1989.
13. M. Rittri. Using types as search keys in function libraries. In Fourth Int. Conf. on Functional Programming Languages and Computer Architecture, London, 1989. ACM Press, Addison-Wesley. (Part B of [14] is a revised version.)
14. M. Rittri. Searching Program Libraries by Type and Proving Compiler Correctness by Bisimulation. PhD thesis, 1990. Dept. of Comp. Sci., Chalmers U. of Tech. and U. of Göteborg, S-412 96 Göteborg, Sweden. E-mail: rittri@cs.chalmers.se
15. C. Runciman and I. Toyn. Retrieving re-usable software components by polymorphic type. In Fourth Int. Conf. on Functional Programming Languages and Computer Architecture, London, 1989. ACM Press, Addison-Wesley.
16. M. Schmidt-Schauß. Unification in a combination of arbitrary disjoint equational theories. J. of Symbolic Computation, 8:51–99, 1989.
17. J.H. Siekmann. Unification theory. J. of Symbolic Computation, 7:207–274, 1989.
18. S.V. Solov’ev. The category of finite sets and Cartesian closed categories. J. of Soviet Math., 22(3):1387–1400, 1983.
19. M.E. Stickel. A unification algorithm for associative-commutative functions. JACM, 28(3):423–434, July 1981.
20. E. Tidén. First-Order Unification in Combinations of Equational Theories. PhD thesis, 1986. Dept. of Num. Anal. and Comp. Sci., The R. Inst. of Technol., Stockholm, Sweden.
21. D.A. Turner. Miranda: A non-strict functional language with polymorphic types. In J.-P. Jouannaud, ed., Functional Programming Languages and Computer Architecture, Nancy, France, 1985. LNCS 201, pages 1–16, Springer-Verlag.