Result for 01B77BE76A5F3277A0549E3A0AA3ACD540E8EE43

Query result

Key Value
FileName./usr/share/doc/ghc/html/libraries/Agda-2.3.0.1/src/Agda-TypeChecking-Pretty.html
FileSize53105
MD5043E9A88864C024AF7BEFDAE03B297A6
SHA-101B77BE76A5F3277A0549E3A0AA3ACD540E8EE43
SHA-2567AE95B21D422859AFEC826B355234C6C0461796C180365BC024CE88AA2E33486
SSDEEP384:mhCyRsUHL7awT+t8uglDLS55yu0mvBt1KUGRi034bfeQFLQKnD5QL0gj7SEeFz:eMklni
TLSHT17033E2E0C6F38A222173D0D365DE3FE3F4E014EDD9861568A6EF93A657FAC50B806911
hashlookup:parent-total5
hashlookup:trust75

Network graph view

Parents (Total: 5)

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

Key Value
MD5C12A55767465D3B04B4396999D057B1A
PackageArchppc
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.
PackageMaintainerKoji
PackageNameghc-Agda-devel
PackageRelease9.fc19
PackageVersion2.3.0.1
SHA-18F7055A3BAF89B4A535A2A8B4B3FD5310D187E02
SHA-25627FE8FAC2862BF485DBDD55F4D07BF1152D03E1A7F79F031300C82385E90B9E4
Key Value
MD5DF81965D04F6645EB10049093D3C66AF
PackageArchs390x
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
PackageRelease10.fc19
PackageVersion2.3.0.1
SHA-185946C31F8467BB4679DBA86F4F119F3792A74AD
SHA-256F8E9A112A126B4F50F3C5BC3FA79356CCF41511862D6C125FD818C2E6A38C9DF
Key Value
MD58E5776D49E0FF270CFD97428ACCC8AC8
PackageArchs390
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
PackageRelease10.fc19
PackageVersion2.3.0.1
SHA-1026B7F2136D9A544748097B1A3B427E779E7D3FD
SHA-2561D79CB7723FF59556C02D2BB7DEC8C0A2350801EADE545D9871E0767BBE090C7
Key Value
MD57B3E9BF87189A1763CD208E9F8FFF4C9
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.
PackageMaintainerKoji
PackageNameghc-Agda-devel
PackageRelease9.fc19
PackageVersion2.3.0.1
SHA-1FC3AEA5E61989C0DB7D576945E6C3908CE709733
SHA-2568D6CCD1ACCEA302BBF6CD70F8DCB438BEF6F49811CB336C37B1A5B4CDC7F369D
Key Value
MD5584B3D527B66EFB62F1A995EC4BE24FC
PackageArcharmv7hl
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
PackageRelease10.fc19
PackageVersion2.3.0.1
SHA-1E53510882EE52B2FD0701760B04DD766A8E5F40C
SHA-25641B425B97C7331A5E16D67F2FA54746FAC98734A95C2BBB273188D42E74E3CAB