Result for 03D7B1444B460900E1035EB94CFC715D7A354857

Query result

Key Value
FileName./usr/lib/haskell-packages/ghc/lib/s390x-linux-ghc-8.8.4/Agda-2.6.1-HiLbc35vrJaCUyzSCNnAUN/Agda/Compiler/Treeless/GuardsToPrims.hi
FileSize9573
MD52BE3AFDA3D3849877C21075DD0D98577
SHA-103D7B1444B460900E1035EB94CFC715D7A354857
SHA-256274797F075511FFB1F7983DCDC74D940EB8FB76E9BB4133DDD19B5D6F8D82F16
SSDEEP192:HEVi81ZX/Ew2W7P1+djoz7eE9n5tqJSvxlmti/yFj2Ps0vSSmqLhtXnxO1k5EyNx:uFdEw2st+JI7272EaS3q1u1k5EyNEPUf
TLSHT1811293EECF1CD82AC57E08B1487653003F30F6B281C7AF93129891654D53AE86F81AF8
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
FileSize58006132
MD5974DDC35C7ECF53001AE5B63422BBDF8
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+b4
SHA-1D7D42A96CDED263B44F06EAB4C1CAB490CE7E950
SHA-256C3579700129D8F76D74050170AFBB658E03E08DC1184D583C2A61F88BB2C995B
Key Value
FileSize57990816
MD54AB11FEAB32442BC7B0D4854EFB8FD2D
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+b3
SHA-111D8B93027080E2A596C732CA58370C9D31BA064
SHA-2568177E67DF94971CAF5EDC7EB6CD0B15897236B60FA3FBFB68400DEB8B1EF465A