My favorite albums are Metus Mortis, and Soul Temptation.

Hello pcjs,

I've created a Smalltalk memes subreddit r/SmalltalkMemes. However, it's barren and unpolished, for I xer: (1 + 10 i).

Thus I call on you to make it thriving.

Thank you for your attention.

A place for members of r/SmalltalkMemes to chat with each other

Artikl 1

Ól hjůmn býings ár born frý end íkvl in dignity end rajc. Dej ár indoud wid rízn end konšns end šud akt tuwóds van enadr in e spirit of bradrhud.

Artikl 2

Evryvan is intajtld tu ól d rajc end frýdoms set forf in dis Deklarejšn, widaut distinkšn of eny kajnd, sač és rejs, kolr, sex lengvidž, relidžn, politikl or adr opinion, nešnl or soušl oridžin, proprty, brf or adr stejtus. Frdrmór, nou distinkšn šél bý mejd on d bejzis of d politikl, džurisdikšnl or intrnešnl stejtus of d kauntry or teritory tu wič e person bilongs, wedr it bý independent, trast, non-self-gavrning or andr eny adr limitejšn of su a person belongs, whether it be independent, trust, non-self-governing or under

Ahoj, zde je Discord pozvánka https://discord.gg/uKd9xxQC, těším se na spolupráci.

Máme také subreddit: r/placecz

This Discord https://discord.gg/tDhfQHbS is from the 2017 run of reddit place. (I'm not a mod of this server.)

But we probably will have to create a new Discord. The new Discord is here https://discord.gg/uKd9xxQC. Use it for cooperation and diplomacy.

I have two questions one involves type inference and the other involves reflection.

1. Template Haskell vs type inference

I'm using refinement types from the refined library and template haskell refinement refineTH. For example I have these following definitions, the unrefined type:

data UnrefinedStandardCurveDef a =
  UnrefinedStandardCurveDef {
    prime_s :: a,
    aCoeff_s :: a,
    bCoeff_s :: a,
    generator_s :: (a, a),
    order_s :: NN.Integer,
    cofactor_s :: NN.Integer
  }
  deriving Lift

the refinement types:

data StandardCurveDefValidator

instance (Typeable a, In

I've got a formula representing a cut reduction of the par connective:

((Δ⊸(A⅋B))⊗((Δ'⊗A)⊸C)⊗((Δ"⊗B)⊸D))⊸((Δ⊗Δ'⊗Δ")⊸(C⅋D))

I can prove this formula with sequent calculus with the help of the rules for linear logic, but is there a way to manipulate the formula alone like there is propositional calculus for classical logic and show that it's akin to tautology. Or is there a corresponding algebra like there is Boolean algebra in case of classical logic?