Agda User Manual v2.6.3
particular implicit argument using the @(tactic t) attribute, where t : Term → TC ⊤. For instance: clever-search : Term → TC ⊤ clever-search hole = unify hole (lit (nat 17)) the-best-number : {@(tactic arguments to the function: default : {A : Set} → A → Term → TC ⊤ default x hole = bindTC (quoteTC x) (unify hole) search : (depth : Nat) → Term → TC ⊤ example : {@(tactic default 10) depth : Nat} monad TC: postulate TC : ∀ {a} → Set a → Set a returnTC : ∀ {a} {A : Set a} → A → TC A bindTC : ∀ {a b} {A : Set a} {B : Set b} → TC A → (A → TC B) → TC B {-# BUILTIN AGDATCM TC0 码力 | 379 页 | 354.83 KB | 1 年前3Agda User Manual v2.6.2
particular implicit argument using the @(tactic t) attribute, where t : Term → TC ⊤. For instance: clever-search : Term → TC ⊤ clever-search hole = unify hole (lit (nat 17)) the-best-number : {@(tactic arguments to the function: default : {A : Set} → A → Term → TC ⊤ default x hole = bindTC (quoteTC x) (unify hole) search : (depth : Nat) → Term → TC ⊤ example : {@(tactic default 10) depth : Nat} monad TC: postulate TC : ∀ {a} → Set a → Set a returnTC : ∀ {a} {A : Set a} → A → TC A bindTC : ∀ {a b} {A : Set a} {B : Set b} → TC A → (A → TC B) → TC B {-# BUILTIN AGDATCM TC0 码力 | 348 页 | 414.11 KB | 1 年前3Agda User Manual v2.6.2.2
particular implicit argument using the @(tactic t) attribute, where t : Term → TC ⊤. For instance: clever-search : Term → TC ⊤ clever-search hole = unify hole (lit (nat 17)) the-best-number : {@(tactic arguments to the function: default : {A : Set} → A → Term → TC ⊤ default x hole = bindTC (quoteTC x) (unify hole) search : (depth : Nat) → Term → TC ⊤ example : {@(tactic default 10) depth : Nat} monad TC: postulate TC : ∀ {a} → Set a → Set a returnTC : ∀ {a} {A : Set a} → A → TC A bindTC : ∀ {a b} {A : Set a} {B : Set b} → TC A → (A → TC B) → TC B {-# BUILTIN AGDATCM TC0 码力 | 354 页 | 433.60 KB | 1 年前3Agda User Manual v2.6.2.1
particular implicit argument using the @(tactic t) attribute, where t : Term → TC ⊤. For instance: clever-search : Term → TC ⊤ clever-search hole = unify hole (lit (nat 17)) the-best-number : {@(tactic arguments to the function: default : {A : Set} → A → Term → TC ⊤ default x hole = bindTC (quoteTC x) (unify hole) search : (depth : Nat) → Term → TC ⊤ example : {@(tactic default 10) depth : Nat} monad TC: postulate TC : ∀ {a} → Set a → Set a returnTC : ∀ {a} {A : Set a} → A → TC A bindTC : ∀ {a b} {A : Set a} {B : Set b} → TC A → (A → TC B) → TC B {-# BUILTIN AGDATCM TC0 码力 | 350 页 | 416.80 KB | 1 年前3Agda User Manual v2.6.3
particular implicit argument using the @(tactic t) attribute, where t : Term → TC ⊤. For instance: clever-search : Term → TC ⊤ clever-search hole = unify hole (lit (nat 17)) the-best-number : {@(tactic arguments to the function: default : {A : Set} → A → Term → TC ⊤ default x hole = bindTC (quoteTC x) (unify hole) search : (depth : Nat) → Term → TC ⊤ example : {@(tactic default 10) depth : Nat} {@(tactic checking monad TC: postulate TC : ∀ {a} → Set a → Set a returnTC : ∀ {a} {A : Set a} → A → TC A bindTC : ∀ {a b} {A : Set a} {B : Set b} → TC A → (A → TC B) → TC B {-# BUILTIN AGDATCM TC #-} (continues0 码力 | 288 页 | 1.24 MB | 1 年前3Agda User Manual v2.5.2
monad TC: postulate TC : ∀ {a} → Set a → Set a returnTC : ∀ {a} {A : Set a} → A → TC A bindTC : ∀ {a b} {A : Set a} {B : Set b} → TC A → (A → TC B) → TC B {-# BUILTIN AGDATCM TC #-} {-# BUILTIN AGDATCMRETURN returnTC #-} {-# BUILTIN AGDATCMBIND bindTC #-} The TC monad provides an interface to the Agda type checker using the following primitive operations: postulate -- metavariables in the process. unify : Term → Term → TC ⊤ -- Throw a type error. Can be caught by catchTC. typeError : ∀ {a} {A : Set a} → List ErrorPart → TC A -- Block a type checking computation on a0 码力 | 151 页 | 152.49 KB | 1 年前3Agda User Manual v2.6.4.1
particular implicit argument using the @(tactic t) attribute, where t : Term → TC ⊤. For instance: clever-search : Term → TC ⊤ clever-search hole = unify hole (lit (nat 17)) the-best-number : {@(tactic arguments to the function: default : {A : Set} → A → Term → TC ⊤ default x hole = bindTC (quoteTC x) (unify hole) search : (depth : Nat) → Term → TC ⊤ example : {@(tactic default 10) depth : Nat} {@(tactic checking monad TC: postulate TC : ∀ {a} → Set a → Set a returnTC : ∀ {a} {A : Set a} → A → TC A bindTC : ∀ {a b} {A : Set a} {B : Set b} → TC A → (A → TC B) → TC B {-# BUILTIN AGDATCM TC #-} {-# BUILTIN0 码力 | 311 页 | 1.38 MB | 1 年前3Agda User Manual v2.6.4.3
particular implicit argument using the @(tactic t) attribute, where t : Term → TC ⊤. For instance: clever-search : Term → TC ⊤ clever-search hole = unify hole (lit (nat 17)) the-best-number : {@(tactic arguments to the function: default : {A : Set} → A → Term → TC ⊤ default x hole = bindTC (quoteTC x) (unify hole) search : (depth : Nat) → Term → TC ⊤ example : {@(tactic default 10) depth : Nat} {@(tactic checking monad TC: postulate TC : ∀ {a} → Set a → Set a returnTC : ∀ {a} {A : Set a} → A → TC A bindTC : ∀ {a b} {A : Set a} {B : Set b} → TC A → (A → TC B) → TC B {-# BUILTIN AGDATCM TC #-} {-# BUILTIN0 码力 | 311 页 | 1.38 MB | 1 年前3Agda User Manual v2.6.4.2
particular implicit argument using the @(tactic t) attribute, where t : Term → TC ⊤. For instance: clever-search : Term → TC ⊤ clever-search hole = unify hole (lit (nat 17)) the-best-number : {@(tactic arguments to the function: default : {A : Set} → A → Term → TC ⊤ default x hole = bindTC (quoteTC x) (unify hole) search : (depth : Nat) → Term → TC ⊤ example : {@(tactic default 10) depth : Nat} {@(tactic checking monad TC: postulate TC : ∀ {a} → Set a → Set a returnTC : ∀ {a} {A : Set a} → A → TC A bindTC : ∀ {a b} {A : Set a} {B : Set b} → TC A → (A → TC B) → TC B {-# BUILTIN AGDATCM TC #-} {-# BUILTIN0 码力 | 311 页 | 1.38 MB | 1 年前3Agda User Manual v2.6.2
particular implicit argument using the @(tactic t) attribute, where t : Term → TC ⊤. For instance: clever-search : Term → TC ⊤ clever-search hole = unify hole (lit (nat 17)) the-best-number : {@(tactic arguments to the function: default : {A : Set} → A → Term → TC ⊤ default x hole = bindTC (quoteTC x) (unify hole) search : (depth : Nat) → Term → TC ⊤ example : {@(tactic default 10) depth : Nat} {@(tactic checking monad TC: postulate TC : ∀ {a} → Set a → Set a returnTC : ∀ {a} {A : Set a} → A → TC A bindTC : ∀ {a b} {A : Set a} {B : Set b} → TC A → (A → TC B) → TC B {-# BUILTIN AGDATCM TC #-} {-# BUILTIN0 码力 | 255 页 | 1.13 MB | 1 年前3
共 34 条
- 1
- 2
- 3
- 4