Result for 10C475FD8DAC7252E4DCF3DC04876CFAA5C2965E

Query result

Key Value
FileName./usr/lib/haskell-packages/ghc/lib/Agda-2.3.0.1/ghc-7.4.1/Agda/TypeChecking/Rules/Record.hi
FileSize13478
MD5141897B6E6FAC95D1996830B88CA54F0
SHA-110C475FD8DAC7252E4DCF3DC04876CFAA5C2965E
SHA-2568B5B30C7D4196AF7F589BE8F19698FA9145DED35DE788A75DEE84F6EA9D5F74A
SSDEEP192:Zjv5D/iE0SxlmFANfHbOCrR4TyR/WKycAZOkj91+YdqROtXrtTjJWwU72Gi/PQ5S:ZjxjiE0krBbOCOTyUKycAJj2f6SvkOFQ
TLSHT12852A3A5670C05B9F6650D771CFD8B115AA07A229287CBEF21D6D1B32D8CC8E1CB7A34
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
FileSize18716716
MD5FD3FB1B2B02FE189864DB4AF440A25B8
PackageDescriptiondependently typed functional programming language - development libraries 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 contains the normal library files.
PackageMaintainerUbuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageNamelibghc-agda-dev
PackageSectionhaskell
PackageVersion2.3.0.1-1build2
SHA-1A7B1F771821D0FFD91F07B29854B1553ECFCA0E5
SHA-256B5959C5B73495D3B58101A1E64EB49BAB5201142E04B76E628ED38046DDCB29F