Result for 01F9A9E936ABF179040F22C5C7C8B07CEC371D2E

Query result

Key Value
FileName./usr/lib/haskell-packages/ghc/lib/s390x-linux-ghc-8.0.2/Agda-2.5.1.1-7y9RpspOu8kGzg5tlmi4Sn/Agda/Syntax/Parser/Tokens.hi
FileSize59944
MD56C75AFBC92328B7DAC079AE2FA6A35B6
SHA-101F9A9E936ABF179040F22C5C7C8B07CEC371D2E
SHA-2563F3C551C0C108E7455E60B7710D3641EF7D0CCAC113F28C4E624AFAF36EE37A7
SSDEEP768:NWFyYVTWJgLQLq9kWR9NJP8ND0osfS5qzTaV5bLE17XuTH31bbCOOuFcubr+a1JV:SaWekvP1fPeeYvTbisnn
TLSHT1A143A26AFF85B037D63A463AC4BA2342772D95817313AFC7A14D52258CC32C6EE9D06D
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
FileSize20088990
MD5D22E39459C9CFF3A7710448BCF327384
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-10D3B508F1EF6229068DB0C391CC8449FF7F2EA49
SHA-256E5175A8CC7EF93C0EB56E2DFB750E9AADF0D31C8547A1E83CFB2516A342CF409