Agda will replace the question mark with a "hole" which can be filled in later. One can also do various other things in the context of a hole: listing the context, inferring the type of an expression type expected in the current hole, along with the types of locally defined identifiers. C−C C−. A variant of C−C C−, that also tries to infer the type of the current hole’s contents. C−C C−SPC Give. written in the current hole has the right type and, if it does, replaces the hole with that term. C-c C-r Refine. Checks whether the return type of the expression e in the hole matches the expected type

tracks and vias … 69 Routing differential pairs … 90 Length tuning … 90 Teardrops … 99 Backdrills and hole post-machining (counterbores/countersinks) … 102 Graphics and text … 106 Rule areas (keepouts) … 128 connection width: 0 mm
Minimum annular width: 0.075 mm
Minimum via diameter: 0.45 mm
Copper to hole clearance: 0.2 mm
Copper to edge clearance: 0.372 mmMaximum allowed deviation: 0.005 filling can be slow when < 0.005 mm.HolesMinimum drill size: 0.3 mm
Hole to hole clearance: 0.25 mmZone Fill Strategy
Allow fillets/chamfers outside zone outline
Minimum

Pre-defined SizesHole clearance violation:ErrorWarningIgnore RulesHole size out of range:ErrorWarningIgnoreViolation SeverityMicro via hole size out of DIP:DIP-14_W7.62mm_LongPads☐Library Description14-lead though-hole mounted DIP package☐KeywordsTHT DIP DIL PDIP 2.54mm 7.62mm 30

Pre-defined SizesHole clearance violation:ErrorWarningIgnore RulesHole size out of range:ErrorWarningIgnoreViolation SeverityMicro via hole size out of DIP:DIP-14_W7.62mm_LongPads☐Library Description14-lead though-hole mounted DIP package☐KeywordsTHT DIP DIL PDIP 2.54mm 7.62mm 30

asking Idris to prove the hole $ r_{hs} $ using the command: p $ r_{hs} $ . Idris by default will show us the initial context. This looks as follows: *Foo> :p rhs Goal: { hole 0 }: (n : Nat) -> (m apply the intros tactic: --Foo.rhs> intros Other goals: { hole 2 } { hole 1 } { hole 0 } Assumptions: n : Nat m : Nat o : Nat Goal: { hole 3 }: plus n (plus m o) = plus (plus n m) o ### 2.3 Induction induction on to n: --Foo.rhs> induction n ------------------- Other goals: elim_SO { hole 2 } { hole 1 } { hole 0 } ------------------- Assumptions: n : Nat m : Nat o : Nat ------------------- Goal:

asking Idris to prove the hole $ r_{hs} $ using the command: p $ r_{hs} $ . Idris by default will show us the initial context. This looks as follows: *Foo> :p rhs Goal: { hole 0 }: (n : Nat) -> (m apply the intros tactic: --Foo.rhs> intros Other goals: { hole 2 } { hole 1 } { hole 0 } Assumptions: n : Nat m : Nat o : Nat Goal: { hole 3 }: plus n (plus m o) = plus (plus n m) o ### 2.3 Induction induction on to n: --Foo.rhs> induction n ------------------- Other goals: elim_SO { hole 2 } { hole 1 } { hole 0 } ------------------- Assumptions: n : Nat m : Nat o : Nat ------------------- Goal:

asking Idris to prove the hole $ r_{hs} $ using the command: p $ r_{hs} $ . Idris by default will show us the initial context. This looks as follows: *Foo> :p rhs Goal: { hole 0 }: (n : Nat) -> (m apply the intros tactic: --Foo.rhs> intros Other goals: { hole 2 } { hole 1 } { hole 0 } Assumptions: n : Nat m : Nat o : Nat Goal: { hole 3 }: plus n (plus m o) = plus (plus n m) o ### 2.3 Induction induction on to n: --Foo.rhs> induction n ------------------- Other goals: elim_SO { hole 2 } { hole 1 } { hole 0 } ------------------- Assumptions: n : Nat m : Nat o : Nat ------------------- Goal:

asking Idris to prove the hole $ r_{hs} $ using the command: p $ r_{hs} $ . Idris by default will show us the initial context. This looks as follows: *Foo> :p rhs Goal: { hole 0 }: (n : Nat) -> (m apply the intros tactic: --Foo.rhs> intros Other goals: { hole 2 } { hole 1 } { hole 0 } Assumptions: n : Nat m : Nat o : Nat Goal: { hole 3 }: plus n (plus m o) = plus (plus n m) o ### 2.3 Induction induction on to n: --Foo.rhs> induction n ------------------- Other goals: elim_SO { hole 2 } { hole 1 } { hole 0 } ------------------- Assumptions: n : Nat m : Nat o : Nat ------------------- Goal:

asking Idris to prove the hole $ r_{hs} $ using the command: p $ r_{hs} $ . Idris by default will show us the initial context. This looks as follows: *Foo> :p rhs Goal: { hole 0 }: (n : Nat) -> (m apply the intros tactic: --Foo.rhs> intros Other goals: { hole 2 } { hole 1 } { hole 0 } Assumptions: n : Nat m : Nat o : Nat Goal: { hole 3 }: plus n (plus m o) = plus (plus n m) o ### 2.3 Induction induction on to n: --Foo.rhs> induction n ------------------- Other goals: elim_SO { hole 2 } { hole 1 } { hole 0 } ------------------- Assumptions: n : Nat m : Nat o : Nat ------------------- Goal:

asking Idris to prove the hole $ r_{hs} $ using the command: p $ r_{hs} $ . Idris by default will show us the initial context. This looks as follows: *Foo> :p rhs Goal: { hole 0 }: (n : Nat) -> (m apply the intros tactic: --Foo.rhs> intros Other goals: { hole 2 } { hole 1 } { hole 0 } Assumptions: n : Nat m : Nat o : Nat Goal: { hole 3 }: plus n (plus m o) = plus (plus n m) o ### 2.3 Induction induction on to n: --Foo.rhs> induction n ------------------- Other goals: elim_SO { hole 2 } { hole 1 } { hole 0 } ------------------- Assumptions: n : Nat m : Nat o : Nat ------------------- Goal: