Hoogle Search

Within LTS Haskell 24.52 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

  1. module Documentation.SBV.Examples.BitPrecise.PEXT_PDEP

    Models the x86 PEXT and PDEP instructions. The pseudo-code implementation given by Intel for PEXT (parallel extract) is: 

    TEMP := SRC1;
MASK := SRC2;
DEST := 0 ;
m := 0, k := 0;
DO WHILE m < OperandSize
IF MASK[m] = 1 THEN
DEST[k] := TEMP[m];
k := k+ 1;
FI
m := m+ 1;
OD
    PDEP (parallel deposit) is similar, except the assigment is: 
    DEST[m] := TEMP[k]
    In PEXT, we grab the values of the source corresponding to the mask, and pile them into the destination from the bottom. In PDEP, we do the reverse: We distribute the bits from the bottom of the source to the destination according to the mask.

  2. module Documentation.SBV.Examples.BitPrecise.PrefixSum

    The PrefixSum algorithm over power-lists and proof of the Ladner-Fischer implementation. See https://www.cs.utexas.edu/~misra/psp.dir/powerlist.pdf and http://www.cs.utexas.edu/~plaxton/c/337/05f/slides/ParallelRecursion-4.pdf.

  3. type PowerList a = [a]

    sbv Documentation.SBV.Examples.BitPrecise.PrefixSum

    A poor man's representation of powerlists and basic operations on them: https://www.cs.utexas.edu/~misra/psp.dir/powerlist.pdf. We merely represent power-lists by ordinary lists.

  4. module Documentation.SBV.Examples.CodeGeneration.PopulationCount

    Computing population-counts (number of set bits) and automatically generating C code.

  5. module Documentation.SBV.Examples.Crypto.Prince

    Implementation of Prince encryption and decrytion, following the spec https://eprint.iacr.org/2012/529.pdf

  6. type PT = Block

    sbv Documentation.SBV.Examples.Crypto.Prince

    Plantext is simply a block.

  7. module Documentation.SBV.Examples.Misc.Polynomials

    Simple usage of polynomials over GF(2^n), using Rijndael's finite field: http://en.wikipedia.org/wiki/Finite_field_arithmetic#Rijndael.27s_finite_field The functions available are:

    • pMult GF(2^n) Multiplication
    • pDiv GF(2^n) Division
    • pMod GF(2^n) Modulus
    • pDivMod GF(2^n) Division/Modulus, packed together
    Note that addition in GF(2^n) is simply xor, so no custom function is provided.

  8. module Documentation.SBV.Examples.Misc.ProgramPaths

    A simple example of showing how to compute program paths. Consider the simple program: 

    d1 x y = if y < x - 2  then   7 else   2
d2   y = if y > 3      then  10 else  50
d3 x y = if y < -x + 3 then 100 else 200
d4 x y = d1 x y + d2 y + d3 x y
    What are all the possible values d4 x y can take, and what are the values of x and y to obtain these values?

  9. module Documentation.SBV.Examples.Optimization.Production

    Solves a simple linear optimization problem

  10. data Pet

    sbv Documentation.SBV.Examples.Puzzles.Fish

    Pets they keep

Page 997 of many | Previous | Next