Result for 0028E8ADA6C1B0584F7E3B7D32B00FAF718C725F

Query result

Key Value
FileName./usr/lib/haskell-packages/ghc/lib/i386-linux-ghc-8.8.4/Agda-2.6.1-HiLbc35vrJaCUyzSCNnAUN/Agda/Syntax/Parser/Parser.hi
FileSize1504812
MD51FEB8D72C0738845CDD54D04546A7BC5
SHA-10028E8ADA6C1B0584F7E3B7D32B00FAF718C725F
SHA-2560B64E44DEA55E75A130C03EB8FE70F413430D442D8DAEAD19BF96920A31C5AAC
SSDEEP6144:SKmsR5TN6GFkiulIEOTqxbPeGFlSx+P4+K+qWYUbxV+Ybb2C/gUhGt/pgLxFSerH:SKmO0GGkYSnmgZt2gLzKqc9Kw
TLSHT1CF659A5FFF06D113F53806B8CCA92320BB34DC81D6999B07165671798CB32E16E9A9BC
hashlookup:parent-total1
hashlookup:trust55

Network graph view

Parents (Total: 1)

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

Key Value
FileSize38089964
MD5BE8FCC95AC84D8FC7B6E1D414B62FDD9
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.6.1-1+b2
SHA-17882BCA4056AC43813E01865CF3F018F5E986F39
SHA-256EFEAEA134EA429DDBC0D3EEAF522A0123B4A31EA64741DB827AC18CBCB795A8C