Type Reconstruction with First-Class Polymorphic Values

1989 ◽  
Author(s):  
James W. O'Toole ◽  
David K. Gifford
Keyword(s):  
Type Reconstruction

STM Study of Diamond(001) Surface

1992 ◽  
Vol 242 ◽  
Author(s):  
Takashi Tsuno ◽  
Takahiro Imai ◽  
Yoshiki Nishibayashi ◽  
Naoji Fujimori
Keyword(s):  
Methane Concentration ◽  
Chemical Vapor ◽  
Epitaxial Films ◽  
Scanning Tunneling ◽  
Tunneling Microscopy ◽  
Boron Doped Diamond ◽  
Boron Doped ◽  
Partially Observed ◽  
Type Reconstruction ◽  
B Doping

ABSTRACTUndoped and boron-doped diamond epitaxial films were deposited on diamond(001) substrate by micro-wave plasma assisted chemical vapor deposition and their surfaces were studied by scanning tunneling microscopy in air. An atomic order resolution was confirmed for the observation.For the undoped epitaxial films, which showed 2×1 and 1×2 RHEED patterns, dimer type reconstruction was observed and it was considered that the growth occurs through the dimer row extension. In the case of B-doped films, the dimer reconstruction was also observed. However, 2×2 structure due to the absence of dimer was partially observed.The effect of boron concentration and methane concentration during epitaxial growth on the surface morphology were also studied. The morphology observed by STM became flatter, as the concentration of B-doping and methane concentration, during growth, increased.

Type reconstruction with first-class polymorphic values

1989 ◽  
Vol 24 (7) ◽  
pp. 207-217 ◽  
Author(s):  
J. W. O'Toole ◽  
D. K. Gifford
Keyword(s):  
Type Reconstruction

scholarly journals Type Reconstruction for Type Classes

1995 ◽  
Vol 5 (2) ◽  
pp. 201-224 ◽  
Author(s):  
Tobias Nipkow ◽  
Christian Prehofer
Keyword(s):  
Programming Language ◽  
Functional Programming ◽  
Type Inference ◽  
Constraint Solving ◽  
Simple Type ◽  
Inference Problem ◽  
Unification Algorithm ◽  
Type Classes ◽  
Type Reconstruction ◽  
Inference Systems

AbstractWe study the type inference problem for a system with type classes as in the functional programming language Haskell. Type classes are an extension of ML-style polymorphism with overloading. We generalize Milner's work on polymorphism by introducing a separate context constraining the type variables in a typing judgement. This leads to simple type inference systems and algorithms which closely resemble those for ML. In particular, we present a new unification algorithm which is an extension of syntactic unification with constraint solving. The existence of principal types follows from an analysis of this unification algorithm.

Sign in / Sign up

Export Citation Format

Share Document