Skip to content
This repository was archived by the owner on Apr 1, 2025. It is now read-only.

Commit 790f4e3

Browse files
committed
Revert "Define a fixpoint over rank-n quantified mendler-style recursive functions."
This reverts commit 8355060.
1 parent 8355060 commit 790f4e3

File tree

1 file changed

+1
-9
lines changed

1 file changed

+1
-9
lines changed

semantic-core/src/Analysis/Eval.hs

Lines changed: 1 addition & 9 deletions
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
1-
{-# LANGUAGE FlexibleContexts, LambdaCase, OverloadedStrings, RankNTypes, RecordWildCards, ScopedTypeVariables #-}
1+
{-# LANGUAGE FlexibleContexts, LambdaCase, OverloadedStrings, RankNTypes, RecordWildCards #-}
22
module Analysis.Eval
33
( eval
44
, prog1
@@ -9,7 +9,6 @@ module Analysis.Eval
99
, prog6
1010
, ruby
1111
, Analysis(..)
12-
, fix
1312
) where
1413

1514
import Control.Effect.Fail
@@ -27,13 +26,6 @@ import Data.Text (Text)
2726
import GHC.Stack
2827
import Prelude hiding (fail)
2928

30-
fix :: forall f a b
31-
. ((forall x . (x -> a) -> f x -> b) -> (forall x . (x -> a) -> f x -> b))
32-
-> (forall x . (x -> a) -> f x -> b)
33-
fix f = x
34-
where x :: (x -> a) -> f x -> b
35-
x = f x
36-
3729
eval :: ( Carrier sig m
3830
, Member (Reader Loc) sig
3931
, MonadFail m

0 commit comments

Comments
 (0)