(Extended  Home/Search
Context
Related
| cmu.edu/~fp/papers/lics93.ps cmu.edu/afs/cs/user/fp/w...lics93.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cmu.edu/~fp/publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Paliath Narendran Institute of Programming and Logics Department of Computer Science State University of NY at Albany Albany, NY 12222 dran@cs.albany.edu Frank Pfenning Carnegie Mellon University Pittsburgh, PA 15213 fp@cs.cmu.edu Richard Statman Department of Mathematics Carnegie Mellon University Pittsburgh, PA 15213 rstatman@cs.cmu.edu Abstract continue to play an important role in the study of the semantics of programming languages. An axiomatization of the isomorphisms... (Update)
Active bibliography (related documents): More All
1.0: On the Unification Problem for Cartesian Closed Categories.. - Narendran, al. (1989) (Correct)
0.3: Efficient and Flexible Matching of Recursive Types - Palsberg, Zhao (2000) (Correct)
0.3: Efficient Type Matching - Jha, Palsberg, Zhao (2002) (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ ed-unification,
author = "Exte Nd Ed",
title = "On the Unification Problem for Cartesian Closed Categories",
url = "citeseer.ist.psu.edu/751347.html" }
Citations (may not include all citations):788 Rewrite systems - Dershowitz, Jouannaud - 1990
359 Introduction to Higher Order Categorical Logic (context) - Lambek, Scott - 1986
103 Complete sets of reductions for some equational theories (context) - Peterson, Stickel - 1981
62 A unification algorithm for associative-commutative function.. (context) - Stickel - 1981
42 Using types as search keys in function libraries (context) - Rittri - 1991
30 Mathematical Structures in Computer Science (context) - Bruce, Di Cosmo et al. - 1992
27 Complexity of unification problems with associative-commutat.. (context) - Kapur, Narendran
25 Retrieving re-usable software components by polymorphic type - Runciman, Toyn - 1991
23 Associative-commutative unification (context) - Fages - 1987
21 Term rewriting systems: A tutorial (context) - Klop - 1987
17 the unification problem for Cartesian closed categories - Narendran, Pfenning et al. - 1989
17 The category of finite sets and Cartesian closed categories (context) - Soloviev - 1983
17 Equations and rewrite rules: A survey (context) - Huet, Oppen - 1980
13 Retrieving library functions by unifying types modulo linear.. - Rittri - 1992
11 Provable isomorphisms and domain equations in models of type.. (context) - Bruce, Longo - 1985
10 Retrieving library identifiers via equational matching of ty.. - Rittri - 1990
6 Completion of a set of rules modulo a set of equations (context) - Jouannaud, Kirchner - 1986
2 The ordinary identities form a complete axiom system for iso.. (context) - Soloviev - 1993
Documents on the same site (http://www.cs.cmu.edu/~fp/publications.html): More
Verifying Uniqueness in a Logical Framework - Anderson, Pfenning (2004) (Correct)
Compiler Verification in LF - Hannan, Pfenning (1992) (Correct)
Meta-Programming with Names and Necessity - Nanevski, Pfenning (2002) (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