Result for 00BA19409B8516AB4930BC82F932A372528E272E

Query result

Key Value
FileName./usr/lib/haskell-packages/ghc/lib/powerpc64le-linux-ghc-8.0.2/Agda-2.5.1.1-7y9RpspOu8kGzg5tlmi4Sn/Agda/TypeChecking/LevelConstraints.hi
FileSize15303
MD58C5ED4E65CE51B5079A8071F962E2A6C
SHA-100BA19409B8516AB4930BC82F932A372528E272E
SHA-2568DEE5DC0503395CC08BAA6627FB5D1340EE53BCB2CA81A6C086367B07246E386
SSDEEP192:6tlAaeEhXKCRLTASdBSBgv2E2fI2q2n89twUShv+HIuYKADN9nggARnxrtqJ6Wjc:6lAPuXKCRLTASNvTMIlF3nf6fJrjF8B
TLSHT12962936ACF04C116D924073A4CFF4345BF70E9A27217CBDB0149F162A96B9DD2DE2879
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
FileSize17593414
MD50E30789BD6A3513D211825A73291C3F1
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.
PackageMaintainerUbuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageNamelibghc-agda-dev
PackageSectionhaskell
PackageVersion2.5.1.1-3build3
SHA-11AB2C94AD556F0F127230C258073684949FA36F6
SHA-256FE482F2B18B40A2BF2F43D8B73B6D52799A9215A1F54EDCB242B989A2DC6BDE2