Author:
Balat Vincent,Di Cosmo Roberto
Publisher
Springer Berlin Heidelberg
Reference22 articles.
1. Lect Notes Comput Sci;A. Andreev,1997
2. Lect Notes Comput Sci;M.-V. Aponte,1996
3. G. Berry and P.-L. Curien. Theory and practice ofsequen tial algorithms: the kernel ofthe applicative language CDS. In M. Nivat and J. Reynolds, editors, Algebraic methods in semantics, pages 35–87. Cambridge University Press, 1985.
4. K. Bruce, R. Di Cosmo, and G. Longo. Provable isomorphisms oft ypes. Mathematical Structures in Computer Science, 2(2):231–247, 1992.
5. K. Bruce and G. Longo. Provable isomorphisms and domain equations in models oft yped languages. ACM Symposium on Theory of Computing (STOC 85), May 1985.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献