Parents (Total: 8)

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

Key	Value
MD5	E43B520CDFA7A985A25712F7BD856E22
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 provides the Emacs Lisp source files for the Agda interactive mode.
PackageMaintainer	Koji
PackageName	emacs-agda-el
PackageRelease	9.fc19
PackageVersion	2.3.0.1
SHA-1	3C609C28F6405D43AC9D4EC9EB6EF737323AC6C7
SHA-256	FA6478717924018B5E30219F9FE35325DC0DF1E08CBD0CDE5B234DA7E6A57446

Key	Value
MD5	D6B94D599BCE6AF5CBDEC5FD64C8C1F5
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 provides the Emacs Lisp source files for the Agda interactive mode.
PackageMaintainer	Fedora Project
PackageName	emacs-agda-el
PackageRelease	9.el6
PackageVersion	2.3.0.1
SHA-1	0A804BF28458B86084EBD9CCDFD029E840D48FDA
SHA-256	1004A84814BD963A8DD8AC50DF820CE40D8E437979266BCCD160FB957D89AF6B

Key	Value
MD5	CAAEC769557A5833C30626D8D415E728
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 provides the Emacs Lisp source files for the Agda interactive mode.
PackageMaintainer	Fedora Project
PackageName	emacs-agda-el
PackageRelease	9.el6
PackageVersion	2.3.0.1
SHA-1	CD78A952BE895A7C98CE5DB93AB38909618A7054
SHA-256	BBF6E242C503E14E9CB54D0A5F73A4617902913A08BC5D25AFD259CE6CB03F04

Key	Value
MD5	149D45BC88DF7C0923D9CB3111C427CE
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 provides the Emacs Lisp source files for the Agda interactive mode.
PackageMaintainer	Koji
PackageName	emacs-agda-el
PackageRelease	9.fc19
PackageVersion	2.3.0.1
SHA-1	F6EDE9D015D08DB3331EFE3789A4A68A34EF00C7
SHA-256	3D3A2775845BEBFD1E4C7BD027B52854A88DE2AA00E735D8ED2266E861437076

Key	Value
MD5	B1687882326A844827A5852B87FC647A
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 provides the Emacs Lisp source files for the Agda interactive mode.
PackageMaintainer	Fedora Project
PackageName	emacs-agda-el
PackageRelease	9.el6
PackageVersion	2.3.0.1
SHA-1	19AE30BD7615E4689DE0D22C8D5CF65992FC4783
SHA-256	AF19F6E8828A843BEC200EB963518857C61BE58696A6797538F2C891788D45F8

Key	Value
MD5	147998A4712E33FF82439F6DC428CED1
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 provides the Emacs Lisp source files for the Agda interactive mode.
PackageMaintainer	Fedora Project
PackageName	emacs-agda-el
PackageRelease	10.fc19
PackageVersion	2.3.0.1
SHA-1	FA92330CDE7C8445A301719E04584C79856CE58C
SHA-256	5EFC73D7520C994E11F04B4E0F5E3C7E99CFD716AE4C62E744F8BFE316C91FE9

Key	Value
MD5	D71CE9896D2DD4E6027D7B0F4F107598
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 provides the Emacs Lisp source files for the Agda interactive mode.
PackageMaintainer	Fedora Project
PackageName	emacs-agda-el
PackageRelease	10.fc19
PackageVersion	2.3.0.1
SHA-1	A6F685A96E21300978C8D3142572ACA5BBEB583A
SHA-256	B74275BEC99CAD1385EEDAEC7FABEEA1A505E9EBF7C55864F3D807E55EE05DB3

Key	Value
MD5	862D3228EA2C4A96E918D64207897F5D
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 provides the Emacs Lisp source files for the Agda interactive mode.
PackageMaintainer	Fedora Project
PackageName	emacs-agda-el
PackageRelease	10.fc19
PackageVersion	2.3.0.1
SHA-1	8C23D6B3F83EC5911D4F98AFDB29A820181C0750
SHA-256	5EE021AA9FB23AEB4F97F5B84A44E7C1980AA12BB4D439D203C928FE474D802F