Gilles Barthe and Olivier Pons. Type isomorphisms and proof reuse in dependent type theory. In Furio Honsell and Marino Miculan, editors, Foundations of Software Science and Computation Structures, 4th International Conference, FOSSACS 2001, number 2030 in Lecture Notes in Computer Science, pages 57--71, Genova, Italy, April 2001. Springer-Verlag. Home/Search Document Details and Download
Summary Related Articles |
This paper is cited in the following contexts:
Memoization in Type-Directed Partial Evaluation - Balat, Danvy (2002) (Correct)
....over # and g f is the identity function over #. Type isomorphisms provide a way not to worry about unessential details in the representation of data. They are used in functional programming to provide a means to search functions by types [20 22, 39 42] and to match modules by specifications [7, 19]. Searching for converters between particularly complex isomorphic types raises the problem of normalizing composite functions, in order to verify whether they are the identity function or not. Normalization by evaluation provides an elegant solution: we simply write the functions in ML and we ....
Gilles Barthe and Olivier Pons. Type isomorphisms and proof reuse in dependent type theory. In Furio Honsell and Marino Miculan, editors, Foundations of Software Science and Computation Structures, 4th International Conference, FOSSACS 2001, number 2030 in Lecture Notes in Computer Science, pages 57--71, Genova, Italy, April 2001. Springer-Verlag.
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