Robert Harper, Frank Pfenning  Home/Search
Context
Related
| cmu.edu/~rwh/papers/lftheory/lfm.ps 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/~rwh/papers/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Robert Harper and Frank Pfenning Department of Computer Science Carnegie Mellon University July 22, 1999 Abstract Decidability of definitional equality and conversion of terms into canonical form play a central role in the meta-theory of a type-theoretic logical framework. Most studies of definitional equality are based on a confluent, strongly-normalizing notion of reduction. Coquand has considered a different approach, directly proving the correctness of a practical equivalance... (Update)
Similar documents (at the sentence level): More
69.9%: On Equivalence and Canonical Forms in the LF Type Theory.. - Harper, Pfenning (Correct)
58.3%: On Equivalence and Canonical Forms in the LF Type Theory - Harper, Pfenning (1999) (Correct)
36.5%: On Equivalence and Canonical Forms - In The Lf (Correct)
Active bibliography (related documents): More All
0.2: Higher-Order Rewriting with Dependent Types - Virga (1999) (Correct)
0.2: A concurrent logical framework I: Judgments and.. - Watkins, Cervesato.. (2003) (Correct)
0.1: Mechanizing Language Definitions - Harper, Licata (2006) (Correct)
Similar documents based on text: More All
0.5: Modularity in the LF Logical Framework - Harper, Pfenning (1991) (Correct)
0.4: A Simplified Account of the Metatheory of Linear LF - Vanderwaart, Crary (2002) (Correct)
0.4: A Framework for Defining Logics - Harper, Honsell, Plotkin (1987) (Correct)
BibTeX entry: (Update)
@misc{ harper-equivalence,
author = "Robert Harper and Frank Pfenning",
title = "On Equivalence and Canonical Forms in the LF Type Theory (Extended Abstract)",
url = "citeseer.ist.psu.edu/article/harper99equivalence.html" }
Citations (may not include all citations):434 A framework for defining logics - Harper, Honsell et al. - 1993
96 An algorithm for testing conversion in type theory (context) - Coquand - 1991
46 Journal of Functional Programming (context) - Jay, Ghani et al. - 1995
43 Natural deduction for intuitionistic non-commutative linear .. - Polakow, Pfenning - 1999
38 Refinement types for logical frameworks - Pfenning - 1993
36 Dipartimento di Informatica (context) - Cervesato, Logical et al. - 1996
35 On equivalence and canonical forms in the LF type theory - Harper, Pfenning - 1999
30 ato and Frank Pfenning. A linear logical framework. Informat.. (context) - Cerves - 1998
28 Eta-expansions in dependent type theory --- the calculus of .. - Ghani - 1997
28 Encoding a dependent-type -calculus in a logic programming l.. (context) - Felty, Miller - 1990
28 The Church-Rosser property for fij-reduction in typed -calcu.. (context) - Geuvers - 1992
24 Higher-Order Rewriting with Dependent Types - Virga - 1999
18 the definition of the eta-long normal form in type systems o.. - Dowek, Huet et al. - 1993
16 The Church-Rosser theorem for LF with fij-reduction (context) - Salvesen - 1990
13 Unpublished lecture notes (context) - Pfenning, deduction - 1992
13 Soundness of the logical framework for its typed operational.. (context) - Goguen - 1999
5 Decidable equivalence for singleton kinds (context) - Stone, Harper - 1999
Documents on the same site (http://www.cs.cmu.edu/~rwh/papers/): More
TIL: A Type-Directed Optimizing Compiler for ML - Tarditi, Morrisett, Cheng (1995) (Correct)
Transparent and Opaque Interpretations of Datatypes - Crary, Harper, Cheng.. (Correct)
Compiling Polymorphism Using Intensional Type Analysis - Harper, Morrisett (1995) (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