Extending record typing to type parametric modules with sharing, Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '93, pp.465-478, 1993. ,
DOI : 10.1145/158511.158704
URL : https://hal.archives-ouvertes.fr/inria-00074768
The ML kit, version 1, 1993. ,
Structural subtyping and the notion of power type, Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '88, pp.70-79, 1988. ,
DOI : 10.1145/73560.73566
Typeful programming, Formal Description of Programming Concepts, pp.431-507, 1989. ,
Abstract types and the dot notation, Proc. IFIP TC2 working conference on programming concepts and methods, 1990. ,
URL : https://hal.archives-ouvertes.fr/hal-01499980
Operations on records, Mathematical Foundations of Programming Semantics, pp.22-52, 1989. ,
DOI : 10.1007/BFb0040253
On understanding types, data abstraction, and polymorphism. Computing surveys, pp.471-522, 1985. ,
DOI : 10.1145/6041.6042
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.117.695
Separate compilation in SML. Working note, Magic group, ECRC, 1993. ,
Principal type-schemes for functional programs, Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '82, pp.207-212, 1982. ,
DOI : 10.1145/582153.582176
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.645.5233
A type-theoretic approach to higher-order modules with sharing, Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '94, 1994. ,
DOI : 10.1145/174675.176927
A type discipline for program modules, TAPSOFT 87, pp.308-319211, 1987. ,
DOI : 10.1007/BFb0014988
Higher-order modules and the phase distinction, Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '90, pp.341-354, 1990. ,
DOI : 10.1145/96709.96744
Modules for standard ML, Proceedings of the 1984 ACM Symposium on LISP and functional programming , LFP '84, 1986. ,
DOI : 10.1145/800055.802036
Using dependent types to express modular structure, Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages , POPL '86, pp.277-286, 1986. ,
DOI : 10.1145/512644.512670
The definition of Standard ML, 1990. ,
On the Equivalence of Data Representations, Artificial intelligence and mathematical theory of computation, pp.305-330, 1991. ,
DOI : 10.1016/B978-0-12-450010-5.50023-2
Abstract types have existential type, ACM Transactions on Programming Languages and Systems, vol.10, issue.3, pp.470-502, 1988. ,
DOI : 10.1145/44501.45065
Bounded quantification is undecidable, 19th symposium Principles of Programming Languages, pp.305-315, 1992. ,
DOI : 10.1145/143165.143228
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.39.7516
Extending ML type system with a sorted equational theory, 1992. ,
The Essence of Algol, Algorithmic languages, pp.345-372, 1981. ,
DOI : 10.1007/978-1-4612-4118-8_4
Reasoning about programs in continuation-passing style, Lisp and Functional Programming 1992, pp.288-298, 1992. ,
DOI : 10.1007/bf01019462
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.122.1481
Smartest recompilation, Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '93, pp.439-450, 1993. ,
DOI : 10.1145/158511.158702
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.14.8113
Principal signatures for higher-order program modules, 19th symposium Principles of Programming Languages, pp.189-199, 1992. ,
DOI : 10.1145/143165.143206
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.14.1425
Type abbreviations in signatures. Message sent to the sml mailing list, 1992. ,
Programming in Modula-2, 1983. ,
DOI : 10.1007/978-3-642-96878-5