Result for 0190A5394012E40F93E49859E2B745C1C7337B64

Query result

Key Value
FileName./usr/lib/haskell-packages/ghc/lib/s390x-linux-ghc-8.2.2/Agda-2.5.3-AlW5zQ5MUdtJ9ZrXwUqf3K/Agda/TypeChecking/RecordPatterns.dyn_hi
FileSize101363
MD52A6E77D0A5F1CD23929E2BD9324E8F27
SHA-10190A5394012E40F93E49859E2B745C1C7337B64
SHA-2563AF0E5509B09F6816516ADC5A638637DFFF31E068A614A05CC4F689C8F1352D8
SSDEEP768:5URgeWID238MAnArOf7elFcLeN/zt4Qvd/W2lS71lYX3i5rWuBUa/gnGRtr/ZO+R:mmeb23FigTayzt4QvxW2WrTZU3iaS
TLSHT141A3492ABF494112DA2855B1C9F91354FB34CCC0AA4ABF533158717CEAF36D42F62AD8
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
FileSize24612788
MD5823CC46D912D0B2C62CADF6A5E30E3E3
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-1545CF3CAC12DD4DE2F4502328C2F4B06E19E42B9
SHA-256242484B1F8194729D4CEC98C90B0746D4F34DC1A90C80164DF94384E2E1E1431