(Enter summary)
Abstract: In functional programming environments, one can use types as search keys in program
libraries, if one disregards trivial differences in argument order or currying.
A way to do this is to identify types that are isomorphic in every Cartesian closed
category; simpler put, types should be identified if they are equal under an arithmetic
interpretation, with Cartesian product as multiplication and function space
as exponentiation. When the type system is polymorphic, one may also want to
retrieve... (Update)
Context of citations to this paper: More
...problem of determining whether two types are equivalent. Much previous work on type matching focuses on non recursive types [7, 10, 14, 18 21, 23]. In this paper, we consider equivalence of recursive types. Equality and subtyping of recursive types have been studied in the...
Cited by: More
Jungloid Mining: Helping to Navigate the API Jungle - David Mandelin Lin
(Correct)
On the Unification Problem for Cartesian Closed Categories - Exte Nd Ed
(Correct)
Inferring Type Isomorphisms Generically - Atanassow, Jeuring
(Correct)
Active bibliography (related documents): More All
0.6: Remarks on Isomorphisms in Typed Lambda Calculi with.. - Fiore, Di Cosmo, Balat (2002)
(Correct)
0.5: Combining Symbolic Constraint Solvers on Algebraic Domains - Kirchner, Ringeissen (1994)
(Correct)
0.3: Inherently Nonfinitely Based Lattices - Freese, McNulty, Nation (2001)
(Correct)
Similar documents based on text: More All
0.4: Semi-unification of Two Terms in Abelian Groups - Rittri (1994)
(Correct)
0.3: Scheduling Pilot Training - Rittri, Allerbo (2000)
(Correct)
0.3: Dimension Inference under Polymorphic Recursion - Rittri (1995)
(Correct)
Related documents from co-citation: More All
7: Mathematical Structures in Computer Science (context) - Bruce, Di Cosmo et al. - 1992
5: the unification problem for Cartesian closed categories
- Narendran, Pfenning et al. - 1989
5: The category of finite sets and Cartesian closed categories (context) - Soloviev - 1983
BibTeX entry: (Update)
Mikael Rittri. Retrieving library identifiers via equational matching of types. In M. E. Stickel, editor, Proceedings of the 10th International Conference on Automated Deduction, pages 603--617, Kaiserslautern, Germany, July 1990. Springer-Verlag LNAI 449. http://citeseer.ist.psu.edu/article/rittri92retrieving.html More
@inproceedings{ rittri90retrieving,
author = "Mikael Rittri",
title = "Retrieving Library Identifiers via Equational Matching of Types",
booktitle = "Conference on Automated Deduction",
pages = "603-617",
year = "1990",
url = "citeseer.ist.psu.edu/article/rittri92retrieving.html" }
Citations (may not include all citations):
809
A theory of type polymorphism in programming (context) - Milner - 1978
634
A machine oriented logic based on the resolution principle (context) - Robinson - 1965
343
Principal type-schemes for functional programs (context) - Damas, Milner - 1982
258
Miranda: A non-strict functional language with polymorphic t.. (context) - Turner - 1985
103
Complete sets of reductions for some equational theories (context) - Peterson, Stickel - 1981
95
Elements of Functional Programming (context) - Reade - 1989
76
Equations and rewrite rules: A survey (context) - Huet, Oppen - 1980
64
The Chalmers Lazy-ML compiler (context) - Augustsson, Johnsson - 1989
62
A unification algorithm for associative-commutative function.. (context) - Stickel - 1981
30
Unification in a combination of arbitrary disjoint equationa.. (context) - Schmidt-Schauss - 1989
27
Computing unification algorithms (context) - Kirchner - 1986
17
the unification problem for Cartesian closed categories
- Narendran, Pfenning et al. - 1989
16
Complete sets of unifiers and matchers in equational theorie.. (context) - Fages, Huet - 1986
16
of Symbolic Computation (context) - Siekmann - 1989
8
Associative commutative pattern matching (context) - Hullot - 1979
6
Axiomatic bases for equational theories of natural numbers (context) - Martin - 1972
5
Equational theory of positive numbers with exponentiation is.. (context) - Gurevic - 1990
4
The Implementation of Functional Programming Languages (context) - Hancock, type-checker et al. - 1987
4
First-Order Unification in Combinations of Equational Theori.. (context) - Tid'en - 1986
4
Fast many-to-one matching algorithms (context) - Purdom, Brown - 1985
3
Equational Theories of Natural Numbers and Transfinite Ordin.. (context) - Martin - 1973
2
Some relationships between unification (context) - Burckert - 1986
1
Author's current address: INRIA (context) - Lang, multiplication et al. - 1978
1
Coherence and valid isomorphism in closed categories (context) - Longo, Asperti et al. - 1989
1
Centrum voor Wiskunde en Informatica (context) - Meertens, Siebes et al. - 1990
1
A critical pair lemma for higher-order rewrite systems and i.. (context) - Nipkow - 1990
1
Author's current address: Mathematical Institute (context) - Wilkie, --- et al. - 1981
1
To appear in Mathematical Structures in Computer Science (context) - Bruce, Di Cosmo et al. - 1990
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.math.jussieu.fr/~fermigie/fermivista/ftp/ftp.cs.chalmers.se.html): More
From Gamma to CBS: Refining multiset transformations with.. - Sands, Weichert (1997)
(Correct)
Reflections on Reflections - Barthe, Hatcliff, Sørensen (1997)
(Correct)
A Parallel Functional Database on GRIP - Akerholt, Hammond, Jones, Trinder (1992)
(Correct)
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