Type isomorphisms for module signatures
M.-V
Aponte
R. Di
Cosmo
Programming Languages Implementation and Logic Programming (PLILP)
A linear logical view of linear type isomorphisms
V
Balat
R. Di
Cosmo
Computer Science Logic
Type isomorphisms and proof reuse in dependent type theory
G
Barthes
O
Pons
FOSSACS, number 2030 in LNCS
F. Honsell and M. Miculan
Provable isomorphisms of types
K
Bruce
R
Di
G
Cosmo
Longo
Mathematical Structures in Computer Science
2
2
Provable isomorphisms and domain equations in models of typed languages
K
Bruce
G
Longo
ACM Symposium on Theory of Computing (STOC 85)
Tarski's high school identities
S
Burris
S
Lee
American Mathematical Monthly
100
3
Introduction to extensive and distributive categories
A
Carboni
S
Lack
R
F C
Walters
Journal of Pure and Applied Algebra
84
Introduction to distributive categories
J
R B
Cockett
Mathematical Structures in Computer Science
3
Categories for Types
R
Crole
Cambridge University Press
Recherche dans une bibliothèque de preuves Coq en utilisant le type et modulo isomorphismes
D
Delahaye
R
Di
B
Cosmo
Werner
PRC/GDR de programmation, Pôle Preuves et Spécifications Algébriques
Type isomorphisms in a type assignment framework Deciding type isomorphisms in a type assignment framework
R
Di
Cosmo12
] R. Di
Cosmo
19th Ann. ACM Symp. on Principles of Programming Languages (POPL)
ACM
Special. Issue on ML
Isomorphisms of types: from -calculus to information retrieval and language design
R
Di
Cosmo
Birkhauser
Second order isomorphic types. A proof theoretic study on second order -calculus with surjective pairing and terminal object. Information and Computation
R
Di
Cosmo
An extended arithmetic of ordinal numbers
J
Doner
A
Tarski
Fundamenta Mathematica
65
Isomorphic objects in symmetric monoidal closed categories
K
Dosen
Z
Petric
Mathematical Structures in Computer Science
7
6
Extensional normalisation for typed lambda calculus with sums via Grothendieck logical relations
M
Fiore
R
Di
V
Cosmo
Balat
Equational theory of positive numbers with exponentiation
R
Gurevič
Proceedings of the American Mathematical Society
94
1
Equational theory of positive numbers with exponentiation is not finitely axiomatizable
R
Gurevič
Annals of Pure and Applied Logic
49
Logiques, catégories et machines
Y
Lafont
Université Paris 7
Thèse. de doctorat d'´ etat
Introduction to higher order categorical logic, volume 7 of Cambridge studies in advanced mathematics
J
Lambek
P
Scott
Cambridge University Press
Axiomatic bases for equational theories of natural numbers. Notices of the Am
C
F
Martin
Math. Soc
19
7
778
On the unification problem for cartesian closed categories
P
Narendran
F
Pfenning
R
Statman
Proceedings of the 8 ØØ Symposium on Logic in Computer Science (LICS)
the 8 ØØ Symposium on Logic in Computer Science (LICS)Montreal, Canada
IEEE Computer Society Press
Retrieving library identifiers by equational matching of types
M
Rittri
10 ØØ Int. Conf. on Automated Deduction
Springer- Verlag
Searching program libraries by type and proving compiler correctness by bisimulation
M
Rittri
Göteborg, Sweden
Using types as search keys in function libraries
M
Rittri
Journal of Functional Programming
1
1
Retrieving re-usable software components by polymorphic type
C
Runciman
I
Toyn
Journal of Functional Programming
1
2
Objective number theory and the retract chain condition
S
H
Journal of Pure and Applied Algebra
154
The category of finite sets and cartesian closed categories
S
V
Soloviev
Journal of Soviet Mathematics
22
3
A complete axiom system for isomorphism of types in closed categories
S
V
Soloviev
Logic Programming and Automated Reasoning, 4th International Conference
A. Voronkov
St. Petersburg, Russia
Springer-Verlag
of Cambridge studies in advanced mathematics
Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science (LICS'02) 1043-6871
the 17th Annual IEEE Symposium on Logic in Computer Science (LICS'02) 1043-6871
Cambridge University Press
On exponentiation — A solution to Tarski's high school algebra problem
A
J
Wilkie
Math. Inst. Oxford University