Result for 0042301AC1C2E7E0CD3F0C087702B8E80C154F4F

Query result

Key Value
FileName./usr/share/doc/libghc-agda-doc/html/mini_Agda-TypeChecking-UniversePolymorphism.html
FileSize973
MD5ECBBBE98C9C9EFA9542C40468FE78B67
SHA-10042301AC1C2E7E0CD3F0C087702B8E80C154F4F
SHA-2564FCAA1B1C2B199667E3C48DD19317EAAABAC15B0AE24B15F223B47721BBE73BE
SSDEEP24:hMNmVpks8zQQ1wnkR+VMiT3zQaBTT9BTy8a:Im3GLeTj5B9Bi
TLSHT1DB112526BD65684382339FC5F1F9E30520D6824BC2C10D8CB5D094D7D6CDEDE8546148
hashlookup:parent-total11
hashlookup:trust100

Network graph view

Parents (Total: 11)

The searched file hash is included in 11 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
FileSize2184674
MD5B57ED4DADA0848F09DFC614C14E1D6A7
PackageDescriptiondependently typed functional programming language - documentation 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 documentation files.
PackageMaintainerUbuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageNamelibghc-agda-doc
PackageSectiondoc
PackageVersion2.3.2-1
SHA-1C5864024CE71FCE6E756E34BE256E852A258BD91
SHA-256CFB8D9A8C06B64DE30CD308DDC4E5E1FD5F5DE8EF4F334DE6951A2B8E6A53135
Key Value
FileSize1768608
MD5855F66578A04BF51EE362483E2D1E5D0
PackageDescriptiondependently typed functional programming language - documentation 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 documentation files.
PackageMaintainerUbuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageNamelibghc-agda-doc
PackageSectiondoc
PackageVersion2.3.0.1-2build1
SHA-1945FBDE44DA46714AA1EB5599D39874BFB5646FE
SHA-25665179A83A1D0EE63FCBA80078F27043533A6BE6E6D7553095A55A5F7080B1C82
Key Value
FileSize2186306
MD5AB9B1DE4ABBA9847B05484E3A2C3DC65
PackageDescriptiondependently typed functional programming language; documentation 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 the documentation for 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-doc
PackageSectiondoc
PackageVersion2.3.2.2-1
SHA-16E301188395BA974BD8D1C1C4D4CC68870BE2ED2
SHA-256823ABD8183AACAFD273C7B45ADECAE6AB9AFEAD97BC28F97C6AAB02A2D3578CD
Key Value
FileSize1687042
MD524E733B39043DFF3A1B62BE36000B8DA
PackageDescriptiondependently typed functional programming language - documentation 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 documentation files.
PackageMaintainerUbuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageNamelibghc-agda-doc
PackageSectiondoc
PackageVersion2.3.0.1-1build2
SHA-16ECDAF01F7DD7339014CC2EAE2E3D98043D3C419
SHA-256541FE36ECCA779006EA7FE3900C3327F8136597774806CD5AAD8182CB43942DF
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
FileSize2183424
MD5E77D9359D7492CBADF2CA5A0BA348344
PackageDescriptiondependently typed functional programming language; documentation 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 the documentation for 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-doc
PackageSectiondoc
PackageVersion2.3.2.1-1
SHA-171F3E85C6DCA4DFD52AFF4CE1FADAD3AD121536E
SHA-25636DD649B0954BEC6866E65A7C6637FBA8A3D48372E5A68CE365A69976018A820
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
Key Value
MD5914BD6174F977663D6EA6BA6559F8AC3
PackageArchx86_64
PackageDescriptionThis package provides the Haskell Agda library development files.
PackageMaintainerFedora Project
PackageNameghc-Agda-devel
PackageRelease5.el7
PackageVersion2.3.2.2
SHA-102C3D4814A5912269AEAF80BDF8683D0E142F97B
SHA-256008EFA11A574B711ECE48865195F445856A3B4F858894A21CDB452CA34A4A3CE