Result for 03103D6266F16F57F6D18C3E74A3CDAFE54D8B1F

Query result

Key Value
FileName./usr/lib/haskell-packages/ghc6/lib/Agda-2.2.6/ghc-6.12.1/Agda/Termination/CallGraph.p_hi
FileSize66467
MD542E850115322F302AA6917DE30463AD9
SHA-103103D6266F16F57F6D18C3E74A3CDAFE54D8B1F
SHA-256DC9F5E64EC5228C046A7ED25DEFA19EC9A0E5AAE44BD1517D5FAFD9DB3E6AAC0
SSDEEP768:Vfab1g59kZasDlw9onkPJqI1TGBVXURUHoNUOUuUPUdoNUqoRqXVYfJaWF7tVhL8:VyS592Oonkh1TGi6GfU8yc3LNlmN5
TLSHT1E2530D5EEF189A06DCE50B3208B703253B25E590D216DF5B638D6172AECB1C95F2B7C8
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
FileSize20598618
MD535FBA8C7A41D26245AF7D597207366A2
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-1F8B8B0F966A3FD1046398818C646A44A7CFEBF84
SHA-256F8B9CFEB5BDA16AAFA8EC05981561D1C2333EC7351947A113E6D54C94624F600