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
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	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
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
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