mirror of
https://github.com/idris-lang/Idris2.git
synced 2024-12-25 12:42:02 +03:00
159 lines
9.1 KiB
Plaintext
159 lines
9.1 KiB
Plaintext
1/1: Building Term (Term.idr)
|
|
LOG unify.equal:10: Skipped unification (equal already): Type and Type
|
|
LOG unify.equal:10: Skipped unification (equal already): Type and Type
|
|
LOG unify.equal:10: Skipped unification (equal already): Type and Type
|
|
LOG unify.equal:10: Skipped unification (equal already): Type and Type
|
|
LOG unify.equal:10: Skipped unification (equal already): Type and Type
|
|
LOG unify.equal:10: Skipped unification (equal already): Type and Type
|
|
LOG unify.equal:10: Skipped unification (equal already): Type and Type
|
|
LOG unify.equal:10: Skipped unification (equal already): Type and Type
|
|
LOG unify.equal:10: Skipped unification (equal already): Type and Type
|
|
LOG unify.equal:10: Skipped unification (equal already): Type and Type
|
|
LOG unify.equal:10: Skipped unification (equal already): Type and Type
|
|
LOG unify.equal:10: Skipped unification (equal already): Type and Type
|
|
LOG declare.type:1: Processing Term.Typ
|
|
LOG unify.equal:10: Skipped unification (equal already): Type and Type
|
|
LOG unify.equal:10: Skipped unification (equal already): Type and Type
|
|
LOG unify.equal:10: Skipped unification (equal already): Type and Type
|
|
LOG unify.equal:10: Skipped unification (equal already): Type and Type
|
|
LOG declare.data:1: Processing Term.Bdr
|
|
LOG unify.equal:10: Skipped unification (equal already): Type and Type
|
|
LOG unify.equal:10: Skipped unification (equal already): Type and Type
|
|
LOG unify.equal:10: Skipped unification (equal already): Type and Type
|
|
LOG unify.equal:10: Skipped unification (equal already): Type and Type
|
|
LOG unify.meta:5: Adding new meta ({P:cut:1}, (Term:1, Rig0))
|
|
LOG unify.meta:5: Adding new meta ({P:vars:1}, (Term:2, Rig0))
|
|
LOG unify.equal:10: Skipped unification (equal already): Type and Type
|
|
LOG unify.meta:5: Adding new meta ({P:cut:2}, (Term:3, Rig0))
|
|
LOG unify.meta:5: Adding new meta ({P:vars:2}, (Term:4, Rig0))
|
|
LOG unify.equal:10: Skipped unification (equal already): Type and Type
|
|
LOG unify.equal:10: Skipped unification (equal already): Type and Type
|
|
LOG declare.data:1: Processing Term.Chk
|
|
LOG unify.equal:10: Skipped unification (equal already): Type and Type
|
|
LOG unify.equal:10: Skipped unification (equal already): Type and Type
|
|
LOG unify.equal:10: Skipped unification (equal already): Type and Type
|
|
LOG unify.equal:10: Skipped unification (equal already): Type and Type
|
|
LOG unify.meta:5: Adding new meta ({P:cut:3}, (Term:5, Rig0))
|
|
LOG unify.meta:5: Adding new meta ({P:vars:3}, (Term:6, Rig0))
|
|
LOG unify.equal:10: Skipped unification (equal already): Type and Type
|
|
LOG unify.equal:10: Skipped unification (equal already): Type and Type
|
|
LOG unify.equal:10: Skipped unification (equal already): Type and Type
|
|
LOG unify.meta:5: Adding new meta ({P:cut:4}, (Term:7, Rig0))
|
|
LOG unify.meta:5: Adding new meta ({P:vars:4}, (Term:8, Rig0))
|
|
LOG unify.meta:5: Adding new meta ({P:n:1}, (Term:9, Rig0))
|
|
LOG unify.equal:10: Skipped unification (equal already): Type and Type
|
|
LOG unify.equal:10: Skipped unification (equal already): Type and Type
|
|
LOG declare.data:1: Processing Term.Syn
|
|
LOG unify.equal:10: Skipped unification (equal already): Type and Type
|
|
LOG unify.equal:10: Skipped unification (equal already): Type and Type
|
|
LOG unify.equal:10: Skipped unification (equal already): Type and Type
|
|
LOG unify.equal:10: Skipped unification (equal already): Type and Type
|
|
LOG unify.meta:5: Adding new meta ({P:vars:5}, (Term:10, Rig0))
|
|
LOG unify.meta:5: Adding new meta ({P:cut:5}, (Term:11, Rig0))
|
|
LOG unify.equal:10: Skipped unification (equal already): Type and Type
|
|
LOG unify.equal:10: Skipped unification (equal already): Type and Type
|
|
LOG unify.meta:5: Adding new meta ({P:cut:6}, (Term:12, Rig0))
|
|
LOG unify.meta:5: Adding new meta ({P:vars:6}, (Term:13, Rig0))
|
|
LOG unify.equal:10: Skipped unification (equal already): Type and Type
|
|
LOG unify.equal:10: Skipped unification (equal already): Type and Type
|
|
LOG unify.equal:10: Skipped unification (equal already): Type and Type
|
|
LOG unify.meta:5: Adding new meta ({P:vars:7}, (Term:14, Rig0))
|
|
LOG unify.equal:10: Skipped unification (equal already): Type and Type
|
|
LOG unify.equal:10: Skipped unification (equal already): Type and Type
|
|
LOG unify.equal:10: Skipped unification (equal already): Type and Type
|
|
LOG declare.def.lhs:3: LHS term: Term.Typ
|
|
LOG unify.equal:10: Skipped unification (equal already): (vars : $resolved1) -> Type and (vars : $resolved1) -> Type
|
|
LOG declare.def.clause:3: RHS term: Term.Chk
|
|
LOG declare.def:2: Case tree for Term.Typ: [0] Term.Chk
|
|
LOG declare.def:3: Working from [0] Term.Chk
|
|
LOG declare.def:3: Catch all case in Term.Typ
|
|
LOG declare.def:3: Initially missing in Term.Typ:
|
|
|
|
LOG declare.type:1: Processing Term.Term
|
|
LOG unify.equal:10: Skipped unification (equal already): Type and Type
|
|
LOG unify.equal:10: Skipped unification (equal already): Type and Type
|
|
LOG unify.equal:10: Skipped unification (equal already): Type and Type
|
|
LOG declare.def.lhs:3: LHS term: Term.Term
|
|
LOG unify.equal:10: Skipped unification (equal already): Type and Type
|
|
LOG declare.def.clause:3: RHS term: (Term.Chk Prelude.Basics.True)
|
|
LOG declare.def:2: Case tree for Term.Term: [0] (Term.Chk Prelude.Basics.True)
|
|
LOG declare.def:3: Working from [0] (Term.Chk Prelude.Basics.True)
|
|
LOG declare.def:3: Catch all case in Term.Term
|
|
LOG declare.def:3: Initially missing in Term.Term:
|
|
|
|
LOG declare.type:1: Processing Term.NF
|
|
LOG unify.equal:10: Skipped unification (equal already): Type and Type
|
|
LOG unify.equal:10: Skipped unification (equal already): Type and Type
|
|
LOG unify.equal:10: Skipped unification (equal already): Type and Type
|
|
LOG declare.def.lhs:3: LHS term: Term.NF
|
|
LOG unify.equal:10: Skipped unification (equal already): Type and Type
|
|
LOG declare.def.clause:3: RHS term: (Term.Chk Prelude.Basics.False)
|
|
LOG declare.def:2: Case tree for Term.NF: [0] (Term.Chk Prelude.Basics.False)
|
|
LOG declare.def:3: Working from [0] (Term.Chk Prelude.Basics.False)
|
|
LOG declare.def:3: Catch all case in Term.NF
|
|
LOG declare.def:3: Initially missing in Term.NF:
|
|
|
|
Term> Bye for now!
|
|
1/1: Building Vec (Vec.idr)
|
|
LOG declare.type:1: Processing Vec.Vec
|
|
LOG declare.def:2: Case tree for Vec.Vec: [0] ({arg:1} : (Data.Fin.Fin {arg:2}[1])) -> {arg:2}[1]
|
|
LOG declare.type:1: Processing Vec.Nil
|
|
LOG declare.def:2: Case tree for Vec.Nil: [0] (Prelude.Uninhabited.absurd {arg:2}[0] (Data.Fin.Fin Prelude.Types.Z) Data.Fin.Uninhabited implementation at Data.Fin:1)
|
|
LOG declare.type:1: Processing Vec.(::)
|
|
LOG declare.def:2: Case tree for Vec.(::): case {arg:2}[4] : (Data.Fin.Fin (Prelude.Types.S {arg:2}[0])) of
|
|
{ Data.Fin.FZ {e:0} => [0] {arg:2}[3]
|
|
| Data.Fin.FS {e:1} {e:2} => [1] ({arg:2}[5] {e:2}[1])
|
|
}
|
|
LOG declare.type:1: Processing Vec.test
|
|
LOG elab.ambiguous:5: Ambiguous elaboration at Vec:1:
|
|
($resolved1 2)
|
|
($resolved2 2)
|
|
With default. Target type : Prelude.Types.Nat
|
|
LOG elab.ambiguous:5: Ambiguous elaboration (kept 3 out of 3 candidates) (not delayed) at Vec:2:
|
|
(($resolved3 Nil) ((:: ((:: (fromInteger 0)) Nil)) Nil))
|
|
(($resolved4 Nil) ((:: ((:: (fromInteger 0)) Nil)) Nil))
|
|
(($resolved5 Nil) ((:: ((:: (fromInteger 0)) Nil)) Nil))
|
|
Target type : ({arg:1} : (Data.Fin.Fin (Prelude.Types.S (Prelude.Types.S Prelude.Types.Z)))) -> (Prelude.Basics.List Prelude.Types.Nat)
|
|
LOG elab.ambiguous:5: Ambiguous elaboration (kept 2 out of 2 candidates) (not delayed) at Vec:3:
|
|
$resolved6
|
|
$resolved7
|
|
Target type : ?Vec.{a:4574}_[]
|
|
LOG elab.ambiguous:5: Ambiguous elaboration (kept 3 out of 3 candidates) (not delayed) at Vec:4:
|
|
(($resolved3 ((:: (fromInteger 0)) Nil)) Nil)
|
|
(($resolved4 ((:: (fromInteger 0)) Nil)) Nil)
|
|
(($resolved5 ((:: (fromInteger 0)) Nil)) Nil)
|
|
Target type : (Vec.Vec ?Vec.{a:4574}_[] ?Vec.{n:4573}_[])
|
|
LOG elab.ambiguous:5: Ambiguous elaboration (kept 3 out of 3 candidates) (not delayed) at Vec:5:
|
|
(($resolved3 (fromInteger 0)) Nil)
|
|
(($resolved4 (fromInteger 0)) Nil)
|
|
(($resolved5 (fromInteger 0)) Nil)
|
|
Target type : ?Vec.{a:4577}_[]
|
|
LOG elab.ambiguous:5: Ambiguous elaboration at Vec:6:
|
|
($resolved1 0)
|
|
($resolved2 0)
|
|
With default. Target type : ?Vec.{a:4579}_[]
|
|
LOG elab.ambiguous:5: Ambiguous elaboration (kept 2 out of 2 candidates) (not delayed) at Vec:7:
|
|
$resolved6
|
|
$resolved7
|
|
Target type : (Vec.Vec ?Vec.{a:4579}_[] ?Vec.{n:4578}_[])
|
|
LOG elab.ambiguous:5: Ambiguous elaboration at Vec:6:
|
|
($resolved1 0)
|
|
($resolved2 0)
|
|
With default. Target type : ?Vec.{a:4578}_[]
|
|
LOG elab.ambiguous:5: Ambiguous elaboration (kept 2 out of 2 candidates) (not delayed) at Vec:8:
|
|
$resolved6
|
|
$resolved7
|
|
Target type : (Vec.Vec ?Vec.{a:4577}_[] ?Vec.{n:4576}_[])
|
|
LOG elab.ambiguous:5: Ambiguous elaboration (kept 1 out of 3 candidates) (delayed) at Vec:5:
|
|
(($resolved4 (fromInteger 0)) Nil)
|
|
Target type : (Prelude.Basics.List Prelude.Types.Nat)
|
|
LOG elab.ambiguous:5: Ambiguous elaboration at Vec:6:
|
|
($resolved1 0)
|
|
($resolved2 0)
|
|
With default. Target type : Prelude.Types.Nat
|
|
LOG elab.ambiguous:5: Ambiguous elaboration (kept 1 out of 2 candidates) (delayed) at Vec:3:
|
|
$resolved7
|
|
Target type : (Prelude.Basics.List Prelude.Types.Nat)
|
|
LOG declare.def:2: Case tree for Vec.test: [0] (Vec.(::) (Prelude.Types.S Prelude.Types.Z) (Prelude.Basics.List Prelude.Types.Nat) (Prelude.Basics.Nil Prelude.Types.Nat) (Vec.(::) Prelude.Types.Z (Prelude.Basics.List Prelude.Types.Nat) (Prelude.Basics.(::) Prelude.Types.Nat Prelude.Types.Z (Prelude.Basics.Nil Prelude.Types.Nat)) (Vec.Nil (Prelude.Basics.List Prelude.Types.Nat))))
|
|
Vec> Bye for now!
|