Result for 01D2C86A4251C7A4417E1F99E97AF3B38B8FD186

Query result

Key Value
FileName./usr/lib/haskell-packages/ghc6/lib/Agda-2.2.6/ghc-6.12.1/Agda/Syntax/Parser/Parser.p_hi
FileSize19090
MD5DD3D1817FAB6E8CF4DAF504FCB9258A4
SHA-101D2C86A4251C7A4417E1F99E97AF3B38B8FD186
SHA-256857A1D0A559A50A646698109F9503490D65F56062CF64A65F0C3DCDF71C7D6A7
SSDEEP384:S6IskxCBgeRHknlP8opXNaNJY2H8UllCUB/cNXLceSsiFHwVRpu+usWPNtbbbfU5:S61JRRHknlPTpXNaNJY2H8UfCUB/cN7n
TLSHT1B382649A6F41A73AD4E0097B08971B215770F110F849CF5B72CC6A769D878EE3D2B368
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
FileSize13616256
MD5705D2A25385E42B0FB1B025C39833F45
PackageDescriptiona dependently typed functional programming language - profiling libraries 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 contains the libraries compiled with profiling enabled.
PackageMaintainerUbuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageNamelibghc6-agda-prof
PackageSectionhaskell
PackageVersion2.2.6-3
SHA-1FE915DD0535F5C42BEABD599F3D0799A5E7F8956
SHA-256B28E8FBD49DF06E509DC0FEE3E0F5C453E4806485969C8576160E7B10D36C6A9