You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
The current implementation is not wrong, but the repr is (COMMON-LISP:OR COMMON-LISP:NUMBER C:COMPLEX), which means any sort of (Lisp) compiler optimization is hosed. This is basically the same issue as specialized arrays, but doesn't deserve as much ceremony as specialized arrays, and there are only two specialized types worth caring about: singles and doubles. We should work to make Coalton emit these specialized types.
The text was updated successfully, but these errors were encountered:
Currently, the above results in an error that complx is an unknown function or variable. But if specialize also worked for types, then the case of complex as well as specialized-vectors/arrays seems solved (?).
@digikar99 I think we can have something similar-ish, where at the definition of complx we can specify different ways :a substitutions can lead to optimized representations. See the draft PR for example details where a proof of concept of the mechanics were implemented, but the syntax is still TBD.
The current implementation is not wrong, but the
repr
is(COMMON-LISP:OR COMMON-LISP:NUMBER C:COMPLEX)
, which means any sort of (Lisp) compiler optimization is hosed. This is basically the same issue as specialized arrays, but doesn't deserve as much ceremony as specialized arrays, and there are only two specialized types worth caring about: singles and doubles. We should work to make Coalton emit these specialized types.The text was updated successfully, but these errors were encountered: