Michèle Crouzet

Michèle Crouzet (born 31 August 1967) is a French politician who was elected to the French National Assembly on 18 June 2017, representing the department of Yonne.[1] From 2017 until 2019, she was a member of La République En Marche! (LREM).

Michèle Crouzet
Member of the National Assembly
for Yonne's 3rd constituency
Assumed office
21 June 2017
Preceded byMarie-Louise Fort
Personal details
Born (1967-08-31) 31 August 1967
Lormes, France
NationalityFrench
Political partyLa République En Marche!
Alma materUniversity of Burgundy

Political career

Having previously been an active member of the Union of Democrats and Independents (UDI), Crouzet joined LREM in 2017.[2]

In parliament, Crouzet serves on the Committee on Economic Affairs. In addition to her committee assignments, she is a member of the French-Venezuelan Parliamentary Friendship Group.[3]

In September 2019, Crouzet announced that she would leave LREM, expressing disagreement in particular on her party’s choice of candidates for the municipal elections.[4]

Political positions

A few months after she took office, Crouzet became known for her disagreements with the party's political line. In early 2019, together with around twenty other LREM members, she proposed to re-establish a solidarity tax on wealth, which had been abolished the previous year.[5]

In July 2019, Crouzet decided not to align with her parliamentary group’s majority and became one of 52 LREM members who abstained from a vote on the French ratification of the European Union’s Comprehensive Economic and Trade Agreement (CETA) with Canada.[6]

gollark: This is using a "state monad", which is basically just what Haskell does because they wanted mutable variables but different somehow.
gollark: Less ironically, it's basically a purely functional way to, well, sequence actions which operate on state, sort of thing.
gollark: It's a monoid in the category of endofunctors.
gollark: Yes, that's right, I KNOW APPROXIMATELY HOW A STATE MONAD WORKS.
gollark: ```haskelldoThing :: Expr -> (M.Map Int IVal, Int)doThing expr = evalState (go expr) 0 where go :: Expr -> State Int (M.Map Int IVal, Int) go (Int x) = do vcount <- update (+1) pure (M.singleton vcount (Lit x), vcount) go (Op o a b) = do (m1, c1) <- go a (m2, c2) <- go b let prev = M.union m1 m2 nxt <- update (+1) pure (M.insert nxt (ROp o c1 c2) prev, nxt)```↑ thusly, none are safe

See also

References

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.