V. C. G. Barthe and O. Pons. Setoids in type theory. Journal of Functional Programming, 13(2):261--293, March 2003. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Type Isomorphisms and Proof Reuse in Dependent Type Theory - Barthe, Pons (2001) (1 citation) Self-citation (Barthe Pons) (Correct)
....for a signature S = F; ar) consists of a set A, called the carrier of the algebra, and of a function f : A ar(f) A for every f 2 F . To formalise algebras, we therefore need to formalise sets and n ary functions. For the sake of simplicity, we formalise sets as types and not as setoids [7]. The type of n ary functions over a type A is denoted by Fun n A and is dened by the recursive equation Fun[n : N] A : Set] Set = case n of 0 ) A j S m ) A (Fun m A) Denition 2. The type Algebra of algebras over a signature is dened by Algebra[S : Signature] Class = fel : Set; int : ....
G. Barthe, V. Capretta, and O. Pons. Setoids in type theory. Submitted, 2000.
Proving Equalities in a Commutative Ring Done Right in Coq - Gregoire, Mahboubi (Correct)
No context found.
V. C. G. Barthe and O. Pons. Setoids in type theory. Journal of Functional Programming, 13(2):261--293, March 2003.
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