archive-fr.com » FR » N » NICOLASPOUILLARD.FR

Total: 307

Choose link from "Titles, links and description words view":

Or switch to "Titles and links view".

  • To From From To equivalence to from record to P to to from P to from Map and zip map f f t t From Setoid f f To Setoid t t f f t t From Setoid f f To Setoid t t From To From To To From To From Equivalence From To Equivalence From To map t f eq record to t to from f from where open Equivalence eq zip f f t t From Setoid f f To Setoid t t f f t t From Setoid f f To Setoid t t f f t t From Setoid f f To Setoid t t From To From To From To To From To From To From Equivalence From To Equivalence From To Equivalence From To zip t f eq eq record to t to eq to eq from f from eq from eq where open Equivalence Equivalence is an equivalence relation Identity and composition reflexivity and transitivity id s s Reflexive Equivalence s s id x S record to F id from F id infixr 9 f f m m t t TransFlip Equivalence f f m m Equivalence m m t t Equivalence

    Original URL path: https://nicolaspouillard.fr/publis/NomPa.agda/Function.Equivalence.html (2015-10-11)
    Open archived version from archive



  • Decidable using True open import Data String as String using String open import Data Digit open import Function open import Data List showInBase b n is a string containing the representation of n in base b showInBase base base 2 True 2 base base 16 True base 16 String showInBase base base 2 base 16 n String fromList map showDigit base 16 base 16 reverse theDigits base base 2 base

    Original URL path: https://nicolaspouillard.fr/publis/NomPa.agda/Data.Nat.Show.html (2015-10-11)
    Open archived version from archive


  • as PropEq using open import Relation Binary PropositionalEquality TrustMe Types Finite strings postulate String Set BUILTIN STRING String COMPILED TYPE String String Possibly infinite strings Costring Set Costring Colist Char Operations private primitive primStringAppend String String String primStringToList String List Char primStringFromList List Char String primStringEquality String String Bool infixr 5 String String String primStringAppend toList String List Char toList primStringToList fromList List Char String fromList primStringFromList toVec s String

    Original URL path: https://nicolaspouillard.fr/publis/NomPa.agda/Data.String.html (2015-10-11)
    Open archived version from archive


  • import Data String as String open import Data Maybe NP data Segment Set where Let Let Segment Path List Segment open M L zero parsePath List Char Path parsePath just parsePath λ cs pure parsePath cs parsePath cs pure parsePath cs parsePath cs pure parsePath cs parsePath L cs pure Let parsePath cs parsePath L cs pure Let parsePath cs parsePath nothing parsePath String Path parsePath parsePath String toList PathOk

    Original URL path: https://nicolaspouillard.fr/publis/NomPa.agda/NomPa.Examples.Path.html (2015-10-11)
    Open archived version from archive


  • Category Monad as Cat module Workaround where open Pa Workaround public never A Set A P never later never perdicativity universes limitation monad f Cat RawMonad f f P monad record return now open Pa public hiding module Workaround module M where open Cat RawMonad Pa monad public open M L zero not univ poly yet A B C Set B C A B A C f g x f

    Original URL path: https://nicolaspouillard.fr/publis/NomPa.agda/Category.Monad.Partiality.NP.html (2015-10-11)
    Open archived version from archive


  • open import Data Bool using Bool true false open import Relation Nullary open import Relation Binary open import Relation Binary PropositionalEquality as PropEq using The type postulate Char Set BUILTIN CHAR Char COMPILED TYPE Char Char Operations private primitive primCharToNat Char primCharEquality Char Char Bool toNat Char toNat primCharToNat infix 4 Char Char Bool primCharEquality Decidable A Char s s with s s true yes trustMe where postulate trustMe false

    Original URL path: https://nicolaspouillard.fr/publis/NomPa.agda/Data.Char.html (2015-10-11)
    Open archived version from archive


  • Nullary Decidable open import Relation Binary hiding open import Relation Binary PropositionalEquality abstract Label Set Label Decidable A Label LabelAssoc Set Set LabelAssoc A List Label A lbls A Set LabelAssoc A List Label lbls L map proj select A Set Label LabelAssoc A Maybe A select xs with filter proj xs nothing x just x update A Set Label A LabelAssoc A LabelAssoc A update A a L map

    Original URL path: https://nicolaspouillard.fr/publis/NomPa.agda/Data.Label.html (2015-10-11)
    Open archived version from archive


  • just g s f s empty A Parser A empty nothing sat Char Bool Parser Char sat pred x xs if pred x then pure x else empty xs sat nothing eof Parser eof s if null s then pure else empty The remaning input is dropped you may want to first combine your parser p with eof p eof runParser A Parser A List Char A runParser p s map proj p s infixr 0 A B Parser A A Parser B Parser B pa f maybe uncurry f nothing pa infixl 0 A B A Parser B Parser A Parser B f pa pa f join A Parser Parser A Parser A join id map A B A B Parser A Parser B map f pa pa pure f infixl 4 A B Parser A B Parser A Parser B pf pa pf λ f pa λ a pure f a A B Parser A Parser B Parser B p p p const p A B Parser A Parser B Parser A p p p λ x p pure x choices A List Parser A Parser A choices L foldr empty mutual many A Parser A Parser List A many p some p pure some A Parser A Parser List A some p pure p many p mutual many A Parser A Parser List A many 0 empty many p suc n some p n pure some A Parser A Parser List A some p n pure p many p n manySat Char Bool Parser List Char manySat p pure manySat p x xs if p x then map first x manySat p xs else pure x xs someSat Char Bool Parser List Char someSat p pure sat p manySat p char Char Parser char c sat c

    Original URL path: https://nicolaspouillard.fr/publis/NomPa.agda/Text.Parser.html (2015-10-11)
    Open archived version from archive