Result for 02506E2D290C6C1ED53ED60430FBE9C4F97D0840

Query result

Key Value
FileName./usr/lib/haskell-packages/ghc/lib/i386-linux-ghc-8.0.2/Agda-2.5.3-3uWTit9Gy0pFt60EMl2f8Z/Agda/TypeChecking/Positivity/Occurrence.dyn_hi
FileSize114203
MD5F43F74DFADB6A79FB8B85CD631434413
SHA-102506E2D290C6C1ED53ED60430FBE9C4F97D0840
SHA-256AB08964F9CAED8EE03B6000B94DCC311B48FCDA51D677FEEA9F76295BE84A704
SSDEEP768:OwV+8td4K3B3/Jx+WPW34w9ZeGQy/qL4Hh3q3LGgN3q3rpiaOUf1c3OiraE7eqs4:RRgMYV/A6iYL8ypEd3HefXqaXSbiK
TLSHT153B3A815EF4AD31BEC3A43B488FA93087B35DEC027568B5750487470ADB32E92D752AE
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
FileSize15703368
MD5A5028998AD298B2FF96B422F19BC19EE
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.5.3-3+b1
SHA-1B62D279A7E114C835C5699AE564FA0AEF52B5C09
SHA-256D90D4B21641477FD31C44B7FF91FAA17F4580CE95CB9A0ABEC096D7C24784972