GaloisInc/cryptol
1
1
Fork 0
mirror of https://github.com/GaloisInc/cryptol.git synced 2024-12-17 13:01:31 +03:00
Code Issues Projects Releases Wiki Activity

Fix haddock parse errors

Browse Source
This commit is contained in:
Brian Huffman 2017-03-09 10:58:55 -08:00
parent fd4415803a
commit f8290af910
2 changed files with 9 additions and 11 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

3
src/Cryptol/Eval/Reference.hs
View File

@ -1,5 +1,6 @@
-- | -- |
-- Module : $Header$ -- Module : $Header$
-- Description : The reference implementation of the Cryptol evaluation semantics.
-- Copyright : (c) 2013-2016 Galois, Inc. -- Copyright : (c) 2013-2016 Galois, Inc.
-- License : BSD3 -- License : BSD3
-- Maintainer : cryptol@galois.com -- Maintainer : cryptol@galois.com
@ -8,8 +9,6 @@
{-# LANGUAGE PatternGuards #-} {-# LANGUAGE PatternGuards #-}
-- | The reference implementation of the Cryptol evaluation semantics.
module Cryptol.Eval.Reference where module Cryptol.Eval.Reference where
import Control.Applicative (liftA2) import Control.Applicative (liftA2)

17
src/Cryptol/TypeCheck/Solve.hs
View File

@ -109,11 +109,11 @@ quickSolverIO ctxt gs =
, d , d
])) -- -} ])) -- -}
quickSolver :: Ctxt -> {- ^ Facts we can know -} quickSolver :: Ctxt -- ^ Facts we can know
[Goal] -> {- ^ Need to solve these -} -> [Goal] -- ^ Need to solve these
Either Goal (Subst,[Goal]) -> Either Goal (Subst,[Goal])
-- ^ Left: contradiciting goals, -- ^ Left: contradicting goals,
-- Right: inferred types, unsolved goals. -- Right: inferred types, unsolved goals.
quickSolver ctxt gs0 = go emptySubst [] gs0 quickSolver ctxt gs0 = go emptySubst [] gs0
where where
go su [] [] = Right (su,[]) go su [] [] = Right (su,[])
@ -364,10 +364,9 @@ computeImprovements s gs =
, (x,t) : _ <- mapMaybe (improveByDefn ints) gs -> , (x,t) : _ <- mapMaybe (improveByDefn ints) gs ->
do let su' = singleSubst x t do let su' = singleSubst x t
debugLog s ("Improve by definition: " ++ show (pp su')) debugLog s ("Improve by definition: " ++ show (pp su'))
return (Right su') -} return (Right su')
| otherwise -> return (Right su)
-- | otherwise -> return (Right su) -}
Nothing -> Nothing ->
do bad <- Num.minimizeContradictionSimpDef s do bad <- Num.minimizeContradictionSimpDef s
(map Num.knownDefined nums) (map Num.knownDefined nums)