Result for 027DE8CC26F5EA0F1FFA8F1B1AD44600CFC4C430

Query result

Key Value
FileName./usr/lib/haskell-packages/ghc/lib/powerpc64le-linux-ghc-8.2.2/Agda-2.5.3-AlW5zQ5MUdtJ9ZrXwUqf3K/Agda/Utils/Graph/AdjacencyMap/Unidirectional.hi
FileSize93501
MD575B667372BD6B5217312B7E50322AD67
SHA-1027DE8CC26F5EA0F1FFA8F1B1AD44600CFC4C430
SHA-256C2B4E8783ABAEADA40FF87972AE0E9C8AF89D376BB07F62C26553CA3613A4ACC
SSDEEP768:fQT84whny5o44zp4UjHo1pKfk/3wlPDk2KS71W5HnOGHIDZ7vBKwiiHHnY+m:fQT1wX44z6Kc/3Qg2+rB+m
TLSHT19A93FA51EF9AD213D61E1AF482BA43486F20D892A785BF173024717CAC77AD03F52ED9
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
FileSize23272728
MD5573B20B65476C87A6C6AB32D81FB3B60
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.3-5build3
SHA-13C714C256B82E2E57CC9BAA2F02E3EA17C29277A
SHA-256790906BEECD1F9D726AC31AB6BB1279BBC6A9DAFD12CADE01664D1EA500E3EFC