Result for 012B8338E5EF7712061C6BA6B2B08D29CC9FF9B7

Query result

Key Value
FileName./usr/lib/haskell-packages/ghc/lib/i386-linux-ghc-8.0.2/Agda-2.5.2-B5Xai748Dl65QDZ7iEML5G/Agda/Utils/Parser/ReadP.dyn_hi
FileSize58074
MD5C6A2EA0F8C2D98FC4861D56C5B0B71CE
SHA-1012B8338E5EF7712061C6BA6B2B08D29CC9FF9B7
SHA-2564A3E115B10EB1F4FFAEFE250BDE817CC9333CB4C05349C25A61BB1ECC8CDEC06
SSDEEP768:GJ83sK6L1+Tl8RUO/V2Q0yw1ggkOtiiFbz9Bp4vQ1TtfKzoHj9PiNpy:GgpESTK+
TLSHT184436F55EF83F71AD81687719A7DE74CBF24DB9026219B1B4009387CAC32B8B6D7131A
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
FileSize13131994
MD584546F10822E9C7086D5D1D9567249E8
PackageDescriptiondependently typed functional programming language 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 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-dev
PackageSectionhaskell
PackageVersion2.5.2-2build1
SHA-1B8C7D16C3B1B1DC8A782263CB10BC30550B59B7F
SHA-256CB6D10EED0F329E60CD4984B4DB11949D1008C7C213D4F0A8F4CF150B098B8B2
Key Value
FileSize13212100
MD50E3B3C025289636F6D19B8144163CA5E
PackageDescriptiondependently typed functional programming language 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 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-dev
PackageSectionhaskell
PackageVersion2.5.2-2+b1
SHA-167F143E0D548D96C3C6489AD81BCC2718D22CB56
SHA-25696F6234800A6D1CA219D3CAFF0EAB719E3C6443E2A08F0D050E4D4C909B3DD55