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
MD5	5257A46DF4C4BEEBE1F91374DB9137EA
PackageArch	i686
PackageDescription	Agda 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.
PackageMaintainer	Fedora Project
PackageName	ghc-Agda-devel
PackageRelease	9.el6
PackageVersion	2.3.0.1
SHA-1	AABF685B352EA808228B22204517063E8BDE83F2
SHA-256	66991D9968BA623BB538328E5C29B53E8D089C9BB8C3C18DDCEF352127064738

Key	Value
MD5	C12A55767465D3B04B4396999D057B1A
PackageArch	ppc
PackageDescription	Agda 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.
PackageMaintainer	Koji
PackageName	ghc-Agda-devel
PackageRelease	9.fc19
PackageVersion	2.3.0.1
SHA-1	8F7055A3BAF89B4A535A2A8B4B3FD5310D187E02
SHA-256	27FE8FAC2862BF485DBDD55F4D07BF1152D03E1A7F79F031300C82385E90B9E4

Key	Value
FileSize	1461100
MD5	DCF85AE30F5E6836993E00578DB6530E
PackageDescription	dependently 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.
PackageMaintainer	Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageName	libghc-agda-doc
PackageSection	doc
PackageVersion	2.2.10-3build1
SHA-1	C9A14E8EA132E4B8A1E76CB2615D759B2693A73B
SHA-256	36A3893C5501713D313C59C47BA3E6BB263E91D81D0644EEA00C6C35C606D287

Key	Value
MD5	047E053618F122DD25F287F061E1540E
PackageArch	ppc64
PackageDescription	Agda 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.
PackageMaintainer	Fedora Project
PackageName	ghc-Agda-devel
PackageRelease	9.el6
PackageVersion	2.3.0.1
SHA-1	F482ECA74881861E457F09F6C3C0B9891A45C9BE
SHA-256	DF92C4445AAFBA5B0FD36E1272FCB4A309ECACBF3F26854B9310EBC0EC104DB3

Key	Value
MD5	2FF65416ACA9C96F52961E40A7F726A2
PackageArch	x86_64
PackageDescription	Agda 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.
PackageMaintainer	Fedora Project
PackageName	ghc-Agda-devel
PackageRelease	9.el6
PackageVersion	2.3.0.1
SHA-1	85DEE0C08B906F3723DABBC90342BFE292F201C4
SHA-256	A34FDA2897890918457F0B5E724ABDE641D9550EDAF5E591A57E53D51A62648D

Key	Value
MD5	8E5776D49E0FF270CFD97428ACCC8AC8
PackageArch	s390
PackageDescription	Agda 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.
PackageMaintainer	Fedora Project
PackageName	ghc-Agda-devel
PackageRelease	10.fc19
PackageVersion	2.3.0.1
SHA-1	026B7F2136D9A544748097B1A3B427E779E7D3FD
SHA-256	1D79CB7723FF59556C02D2BB7DEC8C0A2350801EADE545D9871E0767BBE090C7

Key	Value
FileSize	1687042
MD5	24E733B39043DFF3A1B62BE36000B8DA
PackageDescription	dependently 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.
PackageMaintainer	Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageName	libghc-agda-doc
PackageSection	doc
PackageVersion	2.3.0.1-1build2
SHA-1	6ECDAF01F7DD7339014CC2EAE2E3D98043D3C419
SHA-256	541FE36ECCA779006EA7FE3900C3327F8136597774806CD5AAD8182CB43942DF

Key	Value
MD5	7B3E9BF87189A1763CD208E9F8FFF4C9
PackageArch	ppc64
PackageDescription	Agda 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.
PackageMaintainer	Koji
PackageName	ghc-Agda-devel
PackageRelease	9.fc19
PackageVersion	2.3.0.1
SHA-1	FC3AEA5E61989C0DB7D576945E6C3908CE709733
SHA-256	8D6CCD1ACCEA302BBF6CD70F8DCB438BEF6F49811CB336C37B1A5B4CDC7F369D

Key	Value
FileSize	1768608
MD5	855F66578A04BF51EE362483E2D1E5D0
PackageDescription	dependently 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.
PackageMaintainer	Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageName	libghc-agda-doc
PackageSection	doc
PackageVersion	2.3.0.1-2build1
SHA-1	945FBDE44DA46714AA1EB5599D39874BFB5646FE
SHA-256	65179A83A1D0EE63FCBA80078F27043533A6BE6E6D7553095A55A5F7080B1C82

Key	Value
MD5	584B3D527B66EFB62F1A995EC4BE24FC
PackageArch	armv7hl
PackageDescription	Agda 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.
PackageMaintainer	Fedora Project
PackageName	ghc-Agda-devel
PackageRelease	10.fc19
PackageVersion	2.3.0.1
SHA-1	E53510882EE52B2FD0701760B04DD766A8E5F40C
SHA-256	41B425B97C7331A5E16D67F2FA54746FAC98734A95C2BBB273188D42E74E3CAB

Key	Value
MD5	DF81965D04F6645EB10049093D3C66AF
PackageArch	s390x
PackageDescription	Agda 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.
PackageMaintainer	Fedora Project
PackageName	ghc-Agda-devel
PackageRelease	10.fc19
PackageVersion	2.3.0.1
SHA-1	85946C31F8467BB4679DBA86F4F119F3792A74AD
SHA-256	F8E9A112A126B4F50F3C5BC3FA79356CCF41511862D6C125FD818C2E6A38C9DF