- Sort Score
- Result 10 results
- Languages All
Results 1 - 2 of 2 for lhs (0.01 sec)
-
doc/go_spec.html
<p> Type inference solves type equations through <i>type unification</i>. Type unification recursively compares the LHS and RHS types of an equation, where either or both types may be or contain bound type parameters, and looks for type arguments for those type parameters such that the LHS and RHS match (become identical or assignment-compatible, depending on context).
Registered: Tue Sep 09 11:13:09 UTC 2025 - Last Modified: Tue May 06 19:12:15 UTC 2025 - 286.2K bytes - Viewed (0) -
fess-crawler/src/main/resources/org/codelibs/fess/crawler/mime/tika-mimetypes.xml
<sub-class-of type="text/plain"/> </mime-type> <mime-type type="text/x-haskell"> <_comment>Haskell source code</_comment> <glob pattern="*.hs"/> <glob pattern="*.lhs"/> <sub-class-of type="text/plain"/> </mime-type> <mime-type type="text/x-idl"> <_comment>Interface Definition Language</_comment> <glob pattern="*.idl"/>
Registered: Sun Sep 21 03:50:09 UTC 2025 - Last Modified: Thu Mar 13 08:18:01 UTC 2025 - 320.1K bytes - Viewed (1)