Result for 01E43B3641D8BCE62B63130378A7E7A12E9F6800

Query result

Key Value
FileName./usr/share/doc/libghc-agda-doc/html/Agda-TypeChecking-Primitive.html
FileSize140704
MD51CC379A04935ABA874433E9F11F4BC07
SHA-101E43B3641D8BCE62B63130378A7E7A12E9F6800
SHA-2566257C4A7C862BAF3754E1815D6D69C88BA27D6749A4FA5965D339183C4D6AB9D
SSDEEP768:uE7H/5JBYapTlXeaD6gIceo4NKMQ/UYgJtVvJsDRdlNoSZLvCKWVHnzkkaaKJ80t:d7Hn6KgbzTV9Yas
TLSHT1A0D3D0F22395317AA6714F8595DCFB9AB18325D6E1829E1D30B188F39F0EF389072167
hashlookup:parent-total2
hashlookup:trust60

Network graph view

Parents (Total: 2)

The searched file hash is included in 2 parent files which include package known and seen by metalookup. A sample is included below:

Key Value
FileSize5767640
MD56333359F79E383A78CD124FCC01D133B
PackageDescriptiondependently typed functional programming language; documentation Agda is a dependently typed functional programming language: It has inductive families, which are like Haskell's GADTs, but they can be indexed by values and not just types. It also has parameterised modules, mixfix operators, Unicode characters, and an interactive Emacs interface (the type checker can assist in the development of your code). . Agda is also a proof assistant: It is an interactive system for writing and checking proofs. Agda is based on intuitionistic type theory, a foundational system for constructive mathematics developed by the Swedish logician Per Martin-Löf. It has many similarities with other proof assistants based on dependent types, such as Coq, Epigram and NuPRL. . This package provides the documentation for a library for the Haskell programming language. See http://www.haskell.org/ for more information on Haskell.
PackageMaintainerUbuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageNamelibghc-agda-doc
PackageSectiondoc
PackageVersion2.6.1-1build1
SHA-1F71167EB30EDF3F9CF172B37B33619881451141E
SHA-2562FCDB8567A7DD7D725C0C00D36ACBA49D943301FA2E90935D34821D44FAF6ECF
Key Value
FileSize5799636
MD5FE3EE9AC0D903C4B8B83DAB183283615
PackageDescriptiondependently typed functional programming language; documentation Agda is a dependently typed functional programming language: It has inductive families, which are like Haskell's GADTs, but they can be indexed by values and not just types. It also has parameterised modules, mixfix operators, Unicode characters, and an interactive Emacs interface (the type checker can assist in the development of your code). . Agda is also a proof assistant: It is an interactive system for writing and checking proofs. Agda is based on intuitionistic type theory, a foundational system for constructive mathematics developed by the Swedish logician Per Martin-Löf. It has many similarities with other proof assistants based on dependent types, such as Coq, Epigram and NuPRL. . This package provides the documentation for a library for the Haskell programming language. See http://www.haskell.org/ for more information on Haskell.
PackageMaintainerDebian Haskell Group <pkg-haskell-maintainers@lists.alioth.debian.org>
PackageNamelibghc-agda-doc
PackageSectiondoc
PackageVersion2.6.1-1
SHA-124F9833ABEC801C5B5CF4997CF1F54AC60818D67
SHA-25617FC17B505D40EDD97332CC2FAED6648BF0527E57BAE43CE9E655143391030C4