parametric | Declarative input schemas for Ruby apps | Application Framework library

If I'm understanding correctly, you don't need/want to use the non-specialized role in the final module (that is, you aren't using the Series defined in Dan.rakumod in spike.raku – you're only using the specialized Series defined in Pandas.rakumod). Is that correct?

If so, the solution is simple: just don't export the Series from Dan.rakumod – it's still our scoped (the default for roles) so you can still use it in Pandas.rakumod exactly the way you currently do (Dan::Series). But, since it's not exported, you it won't create a name clash with the non-prefixed Series.

Presumably the algorithm above is referencing cos() and sin() functions that handle the angles in degrees rather than radians, but wherever using angles while employing non-trigonometric transformations, the result will be incorrect.

For example, the following formula using radians...

• phi = (Pi/2)Exp[-theta/(8 Pi)]

...has been incorrectly translated to...

• phi = ( 180 / 2 ) * Math.exp( -theta / ( 8 * 180 ) )

To test, let's assume theta = 2. Using the original formula in radians...

• phi = ( Math.PI / 2 ) * Math.exp( -2 / ( 8 * Math.PI ) )
• = 1.451 rad
• = 83.12 deg

...and now the incorrect version using degrees, which returns a different angle...

• phi = ( 180 / 2 ) * Math.exp( -2 / ( 8 * 180 ) )
• = 89.88 deg
• = 1.569 rad

A similar issue will occur with the incorrectly translated expression...

• pow( ( 1 - ( 3.6 * theta % 360 ) / 180 ), 2 )

Bottom line: Stick to radians.

P.S. Note that there might be other issues, but using radians rather than degrees needs to be corrected foremost...

for the "k" metric:

There's just a problem with parsing one-liners when there's a return type annotation, you can use parentheses to help the parser figure it out:

I have no idea whether what you're doing is a good idea ...

But all that aside, here is something that works for at least your simple use case.

Try:

Yes, because it's false in the standard (simplicial sets) model.

If excluded middle holds, we can define f : {A : Type ℓ} → List A ≃ List A by first doing a case analysis on whether A is contractible or not. If A is not contractible, f gives the identity equivalence, but if A is contractible, then List A is equivalent to Nat, and, f can give an equivalence that, e.g., permutes odds and evens.

The code has been smartly written to work if you pass bare column names.

I'd suggest a solution that bypasses having to pass the generic type as a type parameter directly. For instance, by using what is essentially a record of translators, you can instead pass the name of a given translator and access the type:

Playground