M.-V. Aponte and R. Di Cosmo. Type isomorphisms for module signatures. In Programming Languages Implementation and Logic Programming (PLILP), volume 1140 of Lecture Notes in Computer Science, pages 334--346. Springer-Verlag, 1996. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Subtyping Recursive Types modulo Associative Commutative.. - Di Cosmo, Pottier, Remy (2003) Self-citation (Di cosmo) (Correct)
.... ) t t ) t 3: t t ) t = t (t t 4: t (t ) t t ) t t 5: t 1 = t 6: t 1 = 1 7: 1 t = t The type isomorphisms based approach can help in retrieving complex software components from large libraries of functions [15, 24, 25] or modules [29, 3, 4] and in automatically producing bridge code between different representations of a (possibly recursive) data type in systems like Mockingbird [6, 7] or PolySpin [21] These active areas are currently attracting the attention of many researchers. Unfortunately, the general problem of characterizing ....
M.-V. Aponte and R. Di Cosmo. Type isomorphisms for module signatures. In Programming Languages Implementation and Logic Programming (PLILP), volume 1140 of Lecture Notes in Computer Science, pages 334--346. Springer-Verlag, 1996.
Remarks on Isomorphisms in Typed Lambda Calculi with.. - Fiore, Di Cosmo, Balat (2002) (1 citation) Self-citation (Di cosmo) (Correct)
....aspects of code reuse that become more and more relevant in the heterogeneous environment of what is emerging as global computing. In Functional Programming, type isomorphisms provide a means to search functions by type (see [25, 26, 24, 27, 12, 11, 13] and to match modules by specifications [1]. In proof assistants they are used to find proofs in libraries up to irrelevant syntactical details [10, 3] A characterisation of type isomorphisms has been obtained for monomorphic type systems with various combinations of the unit, product, and arrow type constructors [29, 5, 4] as well as ....
....Bicartesian closed categories are referred to as BiCCCs; they are, of course, distributive. With respect to an interpretation I of base types in a BiCCC S, we write I[ for the interpretation of a type induced by the bicartesian closed structure. That is, I[ I( a base type) I[[1]] 1 ; I[ 1 2 ] I[ 1 ] I[ 2 ] I[ 1 2 ] I[ 1 ] I[ 2 ] I[ 0] 0 ; I[ 1 2 ] I[ 1 ] I[ 2 ] 3 Relating the type theories In this section we relate the various type theories that interest us in the paper. We do this by relating their associated ....
M.-V. Aponte and R. Di Cosmo. Type isomorphisms for module signatures. In Programming Languages Implementation and Logic Programming (PLILP), volume 1140 of Lecture Notes in Computer Science, pages 334--346. Springer-Verlag, 1996.
Subtyping Recursive Types modulo Associative Commutative.. - Di Cosmo, Pottier, Remy (2003) Self-citation (Di cosmo) (Correct)
.... ) 3: 4: 5: 1 = 6: 1 = 1 7: 1 = The type isomorphisms based approach can help in retrieving complex software components from large libraries of functions [15, 24, 25] or modules [28, 3, 4] and in automatically producing bridge code between different representations of a (possibly recursive) data type in systems like Mockingbird [6, 7] or PolySpin [21] These active areas are currently attracting the attention of many researchers. Unfortunately, the general problem of ....
M.-V. Aponte and R. Di Cosmo. Type isomorphisms for module signatures. In Programming Languages Implementation and Logic Programming (PLILP), volume 1140 of Lecture Notes in Computer Science, pages 334--346. Springer-Verlag, 1996.
A Linear Logical View of Linear Type Isomorphisms - Balat, Di Cosmo (1999) (5 citations) Self-citation (Di cosmo) (Correct)
.... ThetaT via 1 and 3. Table 1. Theories of isomorphisms for some type lambda calculi. These results have found their applications in the area of Functional Programming, where they provide a means to search functions by type (see [18, 19, 17, 20, 9, 8, 10] and to match modules by specifications [2]. Also, they are used in proof assistant to find proofs in libraries up to irrelevant syntactical details [6] Linear isomorphisms of types Recently, some weaker variants of isomorphism of types showed to be of practical interest, linear isomorphism of types in particular (e.g. for library ....
M.-V. Aponte and R. Di Cosmo. Type isomorphisms for module signatures. In Programming Languages Implementation and Logic Programming (PLILP), volume 1140 of Lecture Notes in Computer Science, pages 334-- 346. Springer-Verlag, 1996.
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