in the LF Type Theory Robert Harper and Frank Pfenning July 10, 2000...  Home/Search
Context
Related
| cmu.edu/~fp/papers/CMUCS00148.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/~fp/publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
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 equivalence algorithm based on the shape of terms. Neither approach appears to scale well to richer languages with unit types or subtyping,... (Update)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ lf-equivalence,
author = "In The Lf",
title = "On Equivalence and Canonical Forms",
url = "citeseer.ist.psu.edu/752773.html" }
Citations (may not include all citations):434 A framework for defining logics - Harper, Honsell et al. - 1993
382 Lambda calculi with types - Barendregt - 1992
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
39 A Typed Operational Semantics for Type Theory (context) - Goguen - 1994
38 Refinement types for logical frameworks - Pfenning - 1993
36 Dipartimento di Informatica (context) - Cervesato, Logical et al. - 1996
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
[Article contains additional citations not shown here]
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