Parents (Total: 4)

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

Key	Value
MD5	F5CEF03A75240436F31932A158B1F453
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.
PackageMaintainer	Fedora Project
PackageName	Agda
PackageRelease	21.fc32
PackageVersion	2.6.0.1
SHA-1	260B42E4074F93F6B22EE6128B94E8A8EAD44531
SHA-256	4281A4D5209C8C93CFE738A096B73FE162A17F63454E7F4E6C2B1BCC6F906619

Key	Value
FileSize	41180
MD5	2E4FBBECE37C5A1C76EBD215BBDAD104
PackageDescription	dependently typed functional programming language — emacs mode 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 emacs interactive development mode for Agda. This mode is the preferred way to write Agda code, and offers features such as iterative development, refinement, case analysis and so on.
PackageMaintainer	Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageName	elpa-agda2-mode
PackageSection	editors
PackageVersion	2.6.0.1-1build4
SHA-1	A6155012B325750FD6931C3C6FEC89ECA500AA2D
SHA-256	0E79289B62EA37A07CD770787766F9ECA802C7BFD64CFCE142B22A447DE3AA37

Key	Value
MD5	C84147C604CCBEE0190E9DBF55A055E9
PackageArch	aarch64
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.
PackageMaintainer	Fedora Project
PackageName	Agda
PackageRelease	21.fc32
PackageVersion	2.6.0.1
SHA-1	CFF0DECA100564595A1AF1CDE103624137E015A3
SHA-256	3BC4D58CAC6D00E5F8BAB687A67B5B5EA4042C1BD3A08D1BCA70AF56ABE0DED1

Key	Value
FileSize	41824
MD5	22FAEDA70EB35A0857F4CF8B05E2FFD5
PackageDescription	dependently typed functional programming language — emacs mode 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 emacs interactive development mode for Agda. This mode is the preferred way to write Agda code, and offers features such as iterative development, refinement, case analysis and so on.
PackageMaintainer	Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageName	elpa-agda2-mode
PackageSection	editors
PackageVersion	2.6.0.1-1build2
SHA-1	2B18696CB998BC64F3BDE5232EED38073BD6F34D
SHA-256	E95CD5CB9556858C52F363D6412B4AB95E9142F8B654298D026E32C20C022723