Result for 01C4E05EE28ABFACCE8DB2B399324296606C9D0E

Query result

Key Value
FileName./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.0.2/Agda-2.6.2.2-7KnEKyKhaJHFPwDzdI3vIK/Agda/Termination/CallGraph.hi
FileSize29109
MD5E214A42F95231977BD42F10EE26E2C31
SHA-101C4E05EE28ABFACCE8DB2B399324296606C9D0E
SHA-256C765CB1D3B0EA8FE3A5D8E44AEFB4337CB22FA8129A433F06FED141DED88427A
SSDEEP768:xaRPIvkkhvAtXwFV+Nm3W4F67AFGF37ym2rQy7hW1l14pFBWBbFrPrf1oFkAyFn7:ERPIvkkhvAtXwFV+Nm3W4F67AFGF37yM
TLSHT1D3D2882FB388CE41893E0A728C760346E721DCE0362993EF51E927F5CF51AE15C986D9
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
FileSize24853036
MD5A827C1F62CB35F810525E042DA8A4B4E
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.2.2-1.1
SHA-19C7642EEE4646AA11A4215B9C6249C43E53C882A
SHA-2563B1E6380DC53A3CF5F628F3A537AF8BE654E881A1F7C4409E108A59ED7E2C360