Result for 00FAC1882AEE9378E5D1A0B51B986FD1A9D04F27

Query result

Key Value
FileName./usr/share/doc/ghc/html/libraries/Agda-2.3.0.1/mini_Agda-Compiler-MAlonzo-Compiler.html
FileSize4073
MD5090AB534DCED454C756CFCB18A1A757E
SHA-100FAC1882AEE9378E5D1A0B51B986FD1A9D04F27
SHA-2567A7F01A06D76798F09945BAF768EA94137F6D1AE3DED99E444C1109BFA1BE59C
SSDEEP96:lT9kMqixKkoS8Ql8w7rM6Ic1NC04YUMkywV:lT9kMqixKkoS8U8w7rM6I+U04YUMkywV
TLSHT1AB81983B539E78A342531FECE3F5D39B25D3E6D8CD020948BAA509C2FF84E92452B165
hashlookup:parent-total3
hashlookup:trust65

Network graph view

Parents (Total: 3)

The searched file hash is included in 3 parent files which include package known and seen by metalookup. A sample is included below:

Key Value
MD55257A46DF4C4BEEBE1F91374DB9137EA
PackageArchi686
PackageDescriptionAgda is a dependently typed functional programming language: it has inductive families, which are similar to Haskell's GADTs, but they can be indexed by values and not just types. It also has parameterized 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 development files.
PackageMaintainerFedora Project
PackageNameghc-Agda-devel
PackageRelease9.el6
PackageVersion2.3.0.1
SHA-1AABF685B352EA808228B22204517063E8BDE83F2
SHA-25666991D9968BA623BB538328E5C29B53E8D089C9BB8C3C18DDCEF352127064738
Key Value
MD52FF65416ACA9C96F52961E40A7F726A2
PackageArchx86_64
PackageDescriptionAgda is a dependently typed functional programming language: it has inductive families, which are similar to Haskell's GADTs, but they can be indexed by values and not just types. It also has parameterized 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 development files.
PackageMaintainerFedora Project
PackageNameghc-Agda-devel
PackageRelease9.el6
PackageVersion2.3.0.1
SHA-185DEE0C08B906F3723DABBC90342BFE292F201C4
SHA-256A34FDA2897890918457F0B5E724ABDE641D9550EDAF5E591A57E53D51A62648D
Key Value
MD5047E053618F122DD25F287F061E1540E
PackageArchppc64
PackageDescriptionAgda is a dependently typed functional programming language: it has inductive families, which are similar to Haskell's GADTs, but they can be indexed by values and not just types. It also has parameterized 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 development files.
PackageMaintainerFedora Project
PackageNameghc-Agda-devel
PackageRelease9.el6
PackageVersion2.3.0.1
SHA-1F482ECA74881861E457F09F6C3C0B9891A45C9BE
SHA-256DF92C4445AAFBA5B0FD36E1272FCB4A309ECACBF3F26854B9310EBC0EC104DB3