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	115256
MD5	E269B3CA2F98E6FE9F217CFCAD8E7A1B
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.1.1-3
SHA-1	643D06CA0664726A1DA216F856E3342659C999EC
SHA-256	C812023053C2A082C3AD470FE5B5FA23BC674E4FA251F1C7A81EEE5B19D3409D

Key	Value
FileSize	39700
MD5	29CD50A45521CFF33FE90D039089366A
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.1.1-3build3
SHA-1	F3EBB80E3E93D83229D55EBAB5561EC656C43B4C
SHA-256	3CDA9FF16E377E1734931F3A60E860D47D408D15471E5C72BF43223E6A03EBE4