Thierry Coquand. An Algorithm for Testing Conversion in Type Theory. In G'erard Huet and G. Plotkin, editors, Logical frameworks, pages 255--277. Cambridge University Press, 1991. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
A concurrent logical framework I: Judgments and.. - Watkins, Cervesato.. (2003) (2 citations) (Correct)
....notion of equality is decidable. However, the conversions pose a special diculty because of the lack of con uence for reduction in the case of non well typed terms. Since LF typing is dependent on equality, the attempt to de ne an equality based on reduction leads to a Catch 22. Coquand [Coq91] tests convertibility in LF using untyped reduction and extensionality, which is applied when comparing a abstraction to a non abstraction. However, this method fails when a unit type is present as in LLF because it may be necessary to apply extensionality even when neither of the terms ....
Thierry Coquand. An algorithm for testing conversion in type theory. In Gerard Huet and Gordon Plotkin, editors, Logical Frameworks, pages 255-279. Cambridge University Press, 1991.
On Equivalence and Canonical Forms - In The Lf Self-citation (Coquand) (Correct)
No context found.
Coquand, T. 1991. An algorithm for testing conversion in type theory. In Logical Frameworks, G. Huet and G. Plotkin, Eds. Cambridge University Press, 255--279.
Type Theory and Rewriting - BLANQUI (2001) (1 citation) Self-citation (Coquand) (Correct)
No context found.
T. Coquand. An algorithm for testing conversion in type theory. In G. Huet and G. Plotkin, editors, Logical Frameworks, pages 255-279. Cambridge University Press, 1991.
A Logical Framework with Dependently Typed Records - Coquand, Pollack, Takeyama Self-citation (Coquand) (Correct)
No context found.
Thierry Coquand. An algorithm for testing conversion in type theory. In G. Huet and G.D. Plotk in, editors, Logical Frameworks. Cambridge Univ. Press, 1991.
Deciding Type Equivalence in a Language with Singleton Kinds - Stone, Harper (1999) (15 citations) (Correct)
No context found.
Thierry Coquand. An Algorithm for Testing Conversion in Type Theory. In G'erard Huet and G. Plotkin, editors, Logical frameworks, pages 255--277. Cambridge University Press, 1991.
On Equivalence and Canonical Forms - In The Lf (1999) (Correct)
No context found.
Thierry Coquand. An algorithm for testing conversion in type theory. In G'erard Huet and Gordon Plotkin, editors, Logical Frameworks, pages 255--279. Cambridge University Press, 1991.
Unification and Anti-Unification in the Calculus of.. - Frank Pfenning School (1991) (31 citations) (Correct)
No context found.
Thierry Coquand. An algorithm for testing conversion in type theory. In G'erard Huet and Gordon D. Plotkin, editors, Logical Frameworks. Cambridge University Press, 1991. To appear.
Deciding Type Equivalence in a Language with Singleton Kinds - Stone, Harper (1999) (15 citations) (Correct)
No context found.
Thierry Coquand. An Algorithm for Testing Conversion in Type Theory. In G'erard Huet and G. Plotkin, editors, Logical frameworks, pages 255--277. Cambridge University Press, 1991.
On Equivalence and Canonical Forms - In The Lf (Correct)
No context found.
Thierry Coquand. An algorithm for testing conversion in type theory. In G'erard Huet and Gordon Plotkin, editors, Logical Frameworks, pages 255--279. Cambridge University Press, 1991.
A Meta Logical Framework Based on Realizability - Schürmann (2000) (Correct)
No context found.
Thierry Coquand. An algorithm for testing conversion in type theory. In G'erard Huet and Gordon Plotkin, editors, Logical Frameworks, pages 255-- 279. Cambridge University Press, 1991.
Mechanizing Language Definitions - Harper, Licata (2006) (Correct)
No context found.
Coquand, Thierry. (1991). An algorithm for testing conversion in type theory. Logical Frameworks, 255 -- 279.
Verifying Uniqueness in a Logical Framework - Anderson, Pfenning (2004) (1 citation) (Correct)
No context found.
T. Coquand. An algorithm for testing conversion in type theory. In G. Huet and G. Plotkin, editors, Logical Frameworks, pages 255--279. Cambridge University Press, 1991.
Device-Enabled Authorization in the Grey System - Bauer, Garriss, McCune.. (2005) (2 citations) (Correct)
No context found.
T. Coquand. An algorithm for testing conversion in type theory. In G. Huet and G. Plotkin (Eds.): Logical Frameworks, pp. 255--280, Cambridge University Press, 1991.
Decidability of Type-checking in the Calculus of Algebraic.. - Blanqui (2005) (Correct)
No context found.
T. Coquand. An algorithm for testing conversion in type theory. In G. Huet and G. Plotkin, ed., Logical Frameworks, p 255279. Cambridge University Press, 1991.
Rewriting modulo in Deduction modulo - Blanqui (2003) (1 citation) (Correct)
No context found.
T. Coquand. An algorithm for testing conversion in type theory. In G. Huet, G. Plotkin, editors, Logical Frameworks, p. 255279. Cambridge Univ. Press, 1991.
Decidability of Type-checking in the Calculus of Algebraic.. - Blanqui (2005) (Correct)
No context found.
T. Coquand. An algorithm for testing conversion in type theory. In G. Huet and G. Plotkin, editors, Logical Frameworks, pages 255279. Cambridge University Press, 1991.
Definitions by rewriting in the Calculus of Constructions - Blanqui (2003) (2 citations) (Correct)
No context found.
T. Coquand. An algorithm for testing conversion in type theory. In G. Huet and G. Plotkin, editors, Logical Frameworks, pages 255279. Cambridge University Press, 1991.
A Meta Logical Framework Based on Realizability - Schürmann (Correct)
No context found.
Thierry Coquand. An algorithm for testing conversion in type theory. In G'erard Huet and Gordon Plotkin, editors, Logical Frameworks, pages 255-- 279. Cambridge University Press, 1991.
Type checking Dependent (Record) Types and Subtyping - Betarte (Correct)
No context found.
Coquand, Th. (1991). An algorithm for testing conversion in type theory. Pages 71--92 of: L Martin-Lofogical Frameworks, Huet G., Plotkin G. (eds.). Cambridge University Press.
Factoring Proofs - Poswolsky, Schürmann (Correct)
No context found.
T. Coquand. An algorithm for testing conversion in type theory. In G. Huet and G. Plotkin, editors, Logical Frameworks, pages 255--279. Cambridge University Press, 1991.
Verifying Uniqueness in a Logical Framework - Anderson, Pfenning (2004) (1 citation) (Correct)
No context found.
T. Coquand. An algorithm for testing conversion in type theory. In G. Huet and G. Plotkin, editors, Logical Frameworks, pages 255--279. Cambridge University Press, 1991.
Ordinals and Interactive Programs - Hancock (2000) (Correct)
No context found.
T. Coquand. An algorithm for testing conversion in type theory. In G. Huet and G. Plotkin, editors, Logical Frameworks, pages 255--279, Cambridge, 1991. Cambridge University Press.
Higher-Order Intensional Type Analysis in Type-Erasure Semantics - Weirich (2003) (3 citations) (Correct)
No context found.
Thierry Coquand. An algorithm for testing conversion in type theory. In Gerard Huet and Gordon Plotkin, editors, Logical Frameworks, pages 255--277. Cambridge University Press, 1991.
Representing Reductions of NP-Complete Problems in Logical.. - Shah, Schürmann (Correct)
No context found.
Thierry Coquand. An algorithm for testing conversion in type theory. In Gerard Huet and Gordon Plotkin, editors, Logical Frameworks, pages 255--279. Cambridge 14 University Press, 1991.
A Meta Linear Logical Framework - McCreight, Schürmann (2003) (Correct)
No context found.
Thierry Coquand. An algorithm for testing conversion in type theory. In Gerard Huet and Gordon Plotkin, editors, Logical Frameworks, pages 255-- 279. Cambridge University Press, 1991.
First 50 documents Next 50
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