mirror of
https://github.com/idris-lang/Idris2.git
synced 2024-12-17 16:21:46 +03:00
134 lines
9.0 KiB
Plaintext
134 lines
9.0 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:N}, (Term.idr:L:C--L:C, Rig0))
|
|
LOG unify.meta:5: Adding new meta ({P:vars:N}, (Term.idr:L:C--L:C, Rig0))
|
|
LOG unify.equal:10: Skipped unification (equal already): Type and Type
|
|
LOG unify.meta:5: Adding new meta ({P:cut:N}, (Term.idr:L:C--L:C, Rig0))
|
|
LOG unify.meta:5: Adding new meta ({P:vars:N}, (Term.idr:L:C--L:C, 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:N}, (Term.idr:L:C--L:C, Rig0))
|
|
LOG unify.meta:5: Adding new meta ({P:vars:N}, (Term.idr:L:C--L:C, 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:N}, (Term.idr:L:C--L:C, Rig0))
|
|
LOG unify.meta:5: Adding new meta ({P:vars:N}, (Term.idr:L:C--L:C, Rig0))
|
|
LOG unify.meta:5: Adding new meta ({P:n:N}, (Term.idr:L:C--L:C, 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:N}, (Term.idr:L:C--L:C, Rig0))
|
|
LOG unify.meta:5: Adding new meta ({P:cut:N}, (Term.idr:L:C--L:C, 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:N}, (Term.idr:L:C--L:C, Rig0))
|
|
LOG unify.meta:5: Adding new meta ({P:vars:N}, (Term.idr:L:C--L:C, 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:N}, (Term.idr:L:C--L:C, 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 : $resolvedN) -> Type) and (vars : $resolvedN) -> 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 N
|
|
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 N
|
|
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 N
|
|
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:N} : (Data.Fin.Fin {arg:N}[1])) -> {arg:N}[1])
|
|
LOG declare.type:1: Processing Vec.Nil
|
|
LOG declare.def:2: Case tree for Vec.Nil: [0] (Prelude.Uninhabited.absurd {arg:N}[0] ?Vec.{t:N}_[{arg:N}[0]] Data.Fin.Uninhabited implementation at Data/Fin.idr:L:C--L:C)
|
|
LOG declare.type:1: Processing Vec.::
|
|
LOG declare.def:2: Case tree for Vec.::: case {arg:N}[4] : (Data.Fin.Fin (Prelude.Types.S {arg:N}[0])) of
|
|
{ Data.Fin.FZ {e:N} => [0] {arg:N}[3]
|
|
| Data.Fin.FS {e:N} {e:N} => [1] ({arg:N}[5] {e:N}[1])
|
|
}
|
|
LOG declare.type:1: Processing Vec.test
|
|
LOG elab.ambiguous:5: Ambiguous elaboration [($resolvedN 2), ($resolvedN 2)] at Vec.idr:L:C--L:C
|
|
With default. Target type : Prelude.Types.Nat
|
|
LOG elab.ambiguous:5: Ambiguous elaboration False [(($resolvedN Nil) ((:: ((:: (fromInteger 0)) Nil)) Nil)), (($resolvedN Nil) ((:: ((:: (fromInteger 0)) Nil)) Nil)), (($resolvedN Nil) ((:: ((:: (fromInteger 0)) Nil)) Nil))] at Vec.idr:L:C--L:C
|
|
Target type : ({arg:N} : (Data.Fin.Fin (Prelude.Types.S (Prelude.Types.S Prelude.Types.Z)))) -> (Prelude.Types.List Prelude.Types.Nat))
|
|
LOG elab.ambiguous:5: Ambiguous elaboration False [$resolvedN, $resolvedN] at Vec.idr:L:C--L:C
|
|
Target type : ?Vec.{a:N}_[]
|
|
LOG elab.ambiguous:5: Ambiguous elaboration False [(($resolvedN ((:: (fromInteger 0)) Nil)) Nil), (($resolvedN ((:: (fromInteger 0)) Nil)) Nil), (($resolvedN ((:: (fromInteger 0)) Nil)) Nil)] at Vec.idr:L:C--L:C
|
|
Target type : ({arg:N} : (Data.Fin.Fin ?Vec.{n:N}_[])) -> ?Vec.{a:N}_[])
|
|
LOG elab.ambiguous:5: Ambiguous elaboration False [(($resolvedN (fromInteger 0)) Nil), (($resolvedN (fromInteger 0)) Nil), (($resolvedN (fromInteger 0)) Nil)] at Vec.idr:L:C--L:C
|
|
Target type : ?Vec.{a:N}_[]
|
|
LOG elab.ambiguous:5: Ambiguous elaboration [($resolvedN 0), ($resolvedN 0)] at Vec.idr:L:C--L:C
|
|
With default. Target type : ?Vec.{a:N}_[]
|
|
LOG elab.ambiguous:5: Ambiguous elaboration False [$resolvedN, $resolvedN] at Vec.idr:L:C--L:C
|
|
Target type : ({arg:N} : (Data.Fin.Fin ?Vec.{n:N}_[])) -> ?Vec.{a:N}_[])
|
|
LOG elab.ambiguous:5: Ambiguous elaboration [($resolvedN 0), ($resolvedN 0)] at Vec.idr:L:C--L:C
|
|
With default. Target type : ?Vec.{a:N}_[]
|
|
LOG elab.ambiguous:5: Ambiguous elaboration False [$resolvedN, $resolvedN] at Vec.idr:L:C--L:C
|
|
Target type : ({arg:N} : (Data.Fin.Fin ?Vec.{n:N}_[])) -> ?Vec.{a:N}_[])
|
|
LOG elab.ambiguous:5: Ambiguous elaboration True [(($resolvedN (fromInteger 0)) Nil)] at Vec.idr:L:C--L:C
|
|
Target type : (Prelude.Types.List Prelude.Types.Nat)
|
|
LOG elab.ambiguous:5: Ambiguous elaboration [($resolvedN 0), ($resolvedN 0)] at Vec.idr:L:C--L:C
|
|
With default. Target type : Prelude.Types.Nat
|
|
LOG elab.ambiguous:5: Ambiguous elaboration True [$resolvedN] at Vec.idr:L:C--L:C
|
|
Target type : (Prelude.Types.List Prelude.Types.Nat)
|
|
LOG declare.def:2: Case tree for Vec.test: [0] (Vec.:: ?Vec.{n:N}_[] ?Vec.{a:N}_[] (Prelude.Types.Nil Prelude.Types.Nat) (Vec.:: Prelude.Types.Z ?Vec.{a:N}_[] (Prelude.Types.:: Prelude.Types.Nat Prelude.Types.Z (Prelude.Types.Nil Prelude.Types.Nat)) (Vec.Nil ?Vec.{a:N}_[])))
|
|
Vec> Bye for now!
|