P. Courtieu. Normalized types. In Proc. of the 15th Int. Work. on Computer Science Logic, LNCS 2142, 2001. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Quotient Types: A Modular Approach - Nogin (2002) (Correct)
....in this paper. Consequently, in a system that supports a derived rules mechanism, any proof that uses the original N uPRI axiomatization for quotient types would still be valid under our modular axiomatization. For a more detailed comparison of the two axiomatizations see [22, Section 7. 4] In [10] Pierre Courtieu attempts to add to Coq s Calculus of Constructions a notion very similar to quotient type. Instead of aiming at general quotient 6 Several members of NuPRL community made numerous attempts to come up with a satisfactory forrealization. The forrealization presented in this paper ....
....Coq s Calculus of Constructions a notion very similar to quotient type. Instead of aiming at general quotient 6 Several members of NuPRL community made numerous attempts to come up with a satisfactory forrealization. The forrealization presented in this paper was the only one that worked. type, [10] considers types that have a normalization function that, essentially, maps all the members of each equivalence class to a canonical member of the class. Courtieu shows how by equipping a quotient type with such normalization function, one can substantially simplify handling of such a quotient ....
Pierre Courtieu. Normalized types. In L. Fribourg, editor, Computer Science Logic, Proceedings of the loth Annual Conference of the EACSL, volume 2142 of Lecture Notes in Computer Science, pages 554 569. Springer-Verlag, 2001. http://link. springer-ny. com/link/service/series/OSS8/tocs/t2142. htm.
Quotient Types - a Modular Approach - Nogin (2001) (Correct)
....in) etc. 8.3 Collections: a Possible Solution Now that we have [ and [ operators, it is relatively easy to give the proper de nitions. If we take mem(c; t) c(t) and C(i) t:9i 2 I :mem(C(i) t) we can prove all the properties listed in Section 8.2. 9 Related Work In [10] Pierre Courtieu attempts to add to Coq s Calculus of Constructions a notion very similar to quotient type. Instead of aiming at general quotient type, 10] considers types that have a normalization function that, essentially, maps all the members of each equivalence class to a canonical ....
....mem(c; t) c(t) and C(i) t:9i 2 I :mem(C(i) t) we can prove all the properties listed in Section 8.2. 9 Related Work In [10] Pierre Courtieu attempts to add to Coq s Calculus of Constructions a notion very similar to quotient type. Instead of aiming at general quotient type, [10] considers types that have a normalization function that, essentially, maps all the members of each equivalence class to a canonical member of the class. Courtieu shows how by equipping a quotient type with such normalization function, one can substantially simplify handling of such a quotient ....
Pierre Courtieu. Normalized types. In L. Fribourg, editor, Computer Science Logic, Proceedings of the 10th Annual Conference of the EACSL, volume 2142 of Lecture Notes in Computer Science, pages 554-569. Springer-Verlag, 2001. http: //link.springer-ny.com/link/service/series/0558/tocs/t2142.htm.
Type Theory and Rewriting - BLANQUI (2001) (1 citation) (Correct)
No context found.
P. Courtieu. Normalized types. In Proc. of the 15th Int. Work. on Computer Science Logic, LNCS 2142, 2001.
Definitions by rewriting in the Calculus of Constructions - Blanqui (2003) (2 citations) (Correct)
No context found.
P. Courtieu. Normalized types. In Proc. of the 15th Int. Work. on Computer Science Logic, LNCS 2142, 2001.
Theory and Implementation of an Efficient Tactic-Based Logical.. - Nogin (2002) (Correct)
No context found.
Pierre Courtieu. Normalized types. In Fribourg [Fri01], pages 554--569.
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