Results 281 to 286 of about 139,845,986 (286)
Some of the next articles are maybe not open access.
Type inference and type classes
1990Type classes were developed in association with the lazy functional programming language Haskell [1] to handle overloading since no satisfactory off-the-shelf solution was available. The motivation and description of type classes is given in [2].
openaire +2 more sources
Dependently Typed Records in Type Theory
Formal Aspects of Computing, 2002Abstract.The languagePebbleof Burstall and Lampson proposed dependent types as the underlying principle in a unified framework to explain facilities for programming in the large, such asmodulesandsignatures, as well as for programming in the small. This proposal soon extended to large scale formal proof development as well.
openaire +3 more sources
Principal typings and type inference.
1996Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1996. ; Includes bibliographical references (p. 115-120) and index. ; by Trevor Jim. ; Ph.D.
openaire +1 more source
Abstract Data Types and Type Theory: Theories as Types
Mathematical Logic Quarterly, 1991Ruy J. G. B. de Queiroz +1 more
openaire +2 more sources

