Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Narendran, P.
Pfenning, F.
and
Statman, R.
1993.
On the unification problem for Cartesian closed categories.
p.
57.
Rittri, M.
1993.
Retrieving library functions by unifying types modulo linear isomorphism.
RAIRO - Theoretical Informatics and Applications,
Vol. 27,
Issue. 6,
p.
523.
Barbanera, Franco
and
Martini, Simone
1994.
Proof-functional connectives and realizability.
Archive for Mathematical Logic,
Vol. 33,
Issue. 3,
p.
189.
Curien, Pierre-Louis
and
Cosmo, Roberto Di
1996.
A confluent reduction for the λ-calculus with surjective pairing and terminal object.
Journal of Functional Programming,
Vol. 6,
Issue. 2,
p.
299.
Narendran, Paliath
Pfenning, Frank
and
Statman, Richard
1997.
On the unification problem for Cartesian closed categories.
Journal of Symbolic Logic,
Vol. 62,
Issue. 2,
p.
636.
Auerbach, J.
Barton, C.
Chu-Carroll, M.
and
Raghavachari, M.
1999.
Mockingbird: flexible stub compilation from pairs of declarations.
p.
393.
Balat, Vincent
and
Di Cosmo, Roberto
1999.
Computer Science Logic.
Vol. 1683,
Issue. ,
p.
250.
Došen, Kosta
and
Petrić, Zoran
1999.
Cartesian isomorphisms are symmetric monoidal: A justification of linear logic.
Journal of Symbolic Logic,
Vol. 64,
Issue. 1,
p.
227.
Palsberg, J.
and
Tian Zhao
2000.
Efficient and flexible matching of recursive types.
p.
388.
Delahaye, David
2000.
Types for Proofs and Programs.
Vol. 1956,
Issue. ,
p.
131.
Palsberg, Jens
and
Zhao, Tian
2001.
Efficient and Flexible Matching of Recursive Types.
Information and Computation,
Vol. 171,
Issue. 2,
p.
364.
Balat, Vincent
and
Danvy, Olivier
2002.
Generative Programming and Component Engineering.
Vol. 2487,
Issue. ,
p.
78.
Cardone, Felice
2002.
A coinductive completeness proof for the equivalence of recursive types.
Theoretical Computer Science,
Vol. 275,
Issue. 1-2,
p.
575.
Fiore, M.
Di Cosmo, R.
and
Balat, V.
2002.
Remarks on isomorphisms in typed lambda calculi with empty and sum types.
p.
147.
Jha, Somesh
Palsberg, Jens
and
Zhao, Tian
2002.
Foundations of Software Science and Computation Structures.
Vol. 2303,
Issue. ,
p.
187.
Atanassow, Frank
and
Jeuring, Johan
2004.
Mathematics of Program Construction.
Vol. 3125,
Issue. ,
p.
32.
Di Cosmo, Roberto
Pottier, François
and
Rémy, Didier
2005.
Typed Lambda Calculi and Applications.
Vol. 3461,
Issue. ,
p.
179.
Fiore, Marcelo
Di Cosmo, Roberto
and
Balat, Vincent
2006.
Remarks on isomorphisms in typed lambda calculi with empty and sum types.
Annals of Pure and Applied Logic,
Vol. 141,
Issue. 1-2,
p.
35.
Atanassow, Frank
and
Jeuring, Johan
2007.
Customizing an XML–Haskell data binding with type isomorphism inference in Generic Haskell.
Science of Computer Programming,
Vol. 65,
Issue. 2,
p.
72.
Tatsuta, Makoto
2008.
Types for Hereditary Permutators.
p.
83.