Parents (Total: 2)

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

Key	Value
FileSize	155444
MD5	CB52322C72193739AD93FE01E915F965
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	Debian Haskell Group <pkg-haskell-maintainers@lists.alioth.debian.org>
PackageName	elpa-agda2-mode
PackageSection	editors
PackageVersion	2.5.4.1-3
SHA-1	FB2FACFD6CBD3889BE6DCAC8B2AC08899B21A9A8
SHA-256	C7899B0D257F768A8E30FDF1D92FABA18279F466328A7C8F16BEE35432354FB1

Key	Value
FileSize	41428
MD5	9CD5543C0B35A4DCAEADAC030440D837
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.5.4.1-3
SHA-1	F32C68701EA80035A1E3F175E178BAAB21467473
SHA-256	F860D2AA694E976BA0080EE5E1CBF3A6C26400FF48A7948049B80BA8FC0C0D62