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".

  • α T α module TermType M SynAbs renaming T to Term module SemType M FunAbs renaming T to Sem Bug 279 force us to duplicate the type module TermType where data Term α Set where V x Name α Term α abs SynAbs Term α Term α t u Term α Term α module SemType where data Sem α Set where V x Name α Sem α abs FunAbs Sem α Sem α t u Sem α Sem α open TermType public open SemType public coerceSem α β α β Sem α Sem β coerceSem pf V a V coerce pf a coerceSem pf t u coerceSem pf t coerceSem pf u coerceSem pf f λ pf v f trans pf pf v EvalEnv α β World Set EvalEnv α β Name α Sem β α β Γ EvalEnv α β b Sem β EvalEnv b α β Γ v exportWith v Γ app α Sem α Sem α Sem α app f v f refl v app n v n v eval α β EvalEnv α β Term α Sem β eval Γ a t λ pf v eval coerceSem pf Γ a v t eval Γ V x

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



  • map coerceSem pf ts coerceSem pf f λ pf v f trans pf pf v EvalEnv α β World Set EvalEnv α β Name α Sem β α β Γ EvalEnv α β b Sem β EvalEnv b α β Γ v exportWith v Γ app α Sem α Sem α Sem α app f v f refl v app V x ts v V x ts v eval α

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


  • pf pf v module NBE coeEnvPack Envs CoeEnvPack L zero where open Envs CoeEnvPack coeEnvPack EvalEnv α Ω World Set EvalEnv α Ω Env Sem Ω α Ω coeEnv α β γ α β EvalEnv γ α EvalEnv γ β coeEnv pf mapEnv coerceSem pf coerceEnv pf app α Sem α Sem α Sem α app f v f refl v app n v n v eval α β EvalEnv

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


  • mutual data Neu α Set where V x Name α Neu α t Neu α u Sem α Neu α data Sem α Set where N t Neu α Sem α abs FunAbs Sem α Sem α mutual coerceNeu α β α β Neu α Neu β coerceNeu pf V a V coerce pf a coerceNeu pf t u coerceNeu pf t coerceSem pf u coerceSem α β α β Sem α Sem β coerceSem pf N n N coerceNeu pf n coerceSem pf f λ pf v f trans pf pf v EvalEnv α β World Set EvalEnv α β Name α Sem β α β Γ EvalEnv α β b Sem β EvalEnv b α β Γ v exportWith v Γ app α Sem α Sem α Sem α app f v f refl v app N n v N n v eval α β EvalEnv α β Term α Sem β eval Γ a t λ pf v eval coerceSem pf Γ a v t eval Γ V x Γ x eval Γ t u eval Γ t app eval Γ u mutual reify α Supply α Neu α Term α reify s V a V a

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


  • Env NBE dataEnv nomPa module FunEnv NomPa Examples NBE Env NBE funEnv nomPa open NBE TermType id Term ø id 0 V 0 false Term ø false 0 1 V 1 t Term ø t id id id id t Term ø t id false id id t Term ø t id id id false inputs List Term ø inputs t t t outputs List Term ø outputs id id

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


  • s n 0 Tm Tm Tm t 0 u substCTm predWith u V t module Parser where module Tm Tm where Env Set Env String extEnv String Env Env extEnv b Δ s if b s then 0 else suc Δ s Env Tm Tm Δ V x V Δ x Δ b t extEnv b Δ t Δ t u Δ t Δ u conv Tm Tm conv just closeTm Tm Tm const 0 open ParseConv conv public renaming parseConv to parseTm parseConv to parseTm TmOk to Tm Ok open Parser public using parseTm parseTm Tm Ok data Frame Set where arg fct Tm Frame Stack List Frame module KAM where Krivine Abstract Machine slightly modified to have CBV primitives Tm Stack Tm t u π t arg u π push t arg u π later t 0 u π grab Let t u π later u 0 t π v now v v fct t π later t arg v π 1 as function is suc and is CBV 1 arg n π later suc n π 1 arg u π later u fct 1 π debug mode arg stuck where postulate stuck Tm V stuck V where postulate stuck V Tm never runTm Tm Tm runTm t t 1 0 CBV semantics module AAM where Another Abstract Machine Tm Stack Tm t u π u fct t π t arg u π later t 0 u π Let t u π t fct u π v now v v fct u π later u arg v π 1 as a function is suc 1 arg n π later suc n π debug versions n arg t π stuck where postulate stuck Tm V stuck V where postulate stuck V Tm never runTm Tm Tm runTm t t

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


  • Raw where infixl 4 data Tm Set where V x String Tm b String t Tm Tm t u Tm Tm app Tm List Tm Tm app foldl Tm n f x replicapp n V f V x where replicapp

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


  • spaces manySat isSpace pure someSpaces Parser someSpaces someSat isSpace pure var Parser String var map String fromList spaces someNoneOf kwdChars some noneOf kwdChars tok Char Parser tok c spaces char c pure mutual tm Parser Tm tm n pure app tm n many someSpaces tm n n tm Parser Tm tm 0 empty tm suc n pure tok λ var tok tm n tok tm n tok pure V var tm Parser Tm tm 0 empty tm suc n pure tok λ var tok tm n pure tok tm n tok tm n tok pure V var parseTm String Tm parseTm s runParser tm n eof l where l String toList s n length l module ParseConv A conv Tm A where parseConv String A parseConv s conv parseTm s TmOk String Set TmOk just parseConv parseConv s s ok TmOk s A parseConv s s ok with parseConv s parseConv s nothing parseConv s just t t open ParseConv just public using renaming parseConv to parseTm module Tests where open import Relation Binary PropositionalEquality open import Data Product Extras hiding map id String id λx x id Tm id x V x Δ String Δ λx x x Δ

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