Parents (Total: 3)

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

Key	Value
FileSize	66816
MD5	275230FCA40C09C991859CC2FB11B34C
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.6.1-1
SHA-1	863999FE350CE8AFBD5B48BC76630422C9C22C33
SHA-256	80B05DDE13184B5EB1B6392E45FAFCA342893666F64D1A6A08E25F6616E9260A

Key	Value
FileSize	28736
MD5	BB8A90E7E412C529FCEAAE553619367F
PackageDescription	dependently typed functional programming language 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 is a meta package which provides Agda's emacs mode, executable, standard library and its documentation.
PackageMaintainer	Debian Haskell Group <pkg-haskell-maintainers@lists.alioth.debian.org>
PackageName	agda
PackageSection	misc
PackageVersion	2.6.1-1
SHA-1	F3E964E9E75F81731498E2C8BD903B52DAB5602D
SHA-256	9EAB12E39475844362A80726BFDC5CFCF3CDB3DECBEC1B3DF56CF67DBE78B4F1

Key	Value
FileSize	5799636
MD5	FE3EE9AC0D903C4B8B83DAB183283615
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 provides the documentation for a library for the Haskell programming language. See http://www.haskell.org/ for more information on Haskell.
PackageMaintainer	Debian Haskell Group <pkg-haskell-maintainers@lists.alioth.debian.org>
PackageName	libghc-agda-doc
PackageSection	doc
PackageVersion	2.6.1-1
SHA-1	24F9833ABEC801C5B5CF4997CF1F54AC60818D67
SHA-256	17FC17B505D40EDD97332CC2FAED6648BF0527E57BAE43CE9E655143391030C4