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	1253930
MD5	242CD2381A5EA00CB56279375ABDFFF9
PackageDescription	a 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 contains the documentation files.
PackageMaintainer	Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageName	libghc6-agda-doc
PackageSection	doc
PackageVersion	2.2.10-1~ubuntu1
SHA-1	E6D26BD14E31F5D05517DBBC44EAD61ABC06E237
SHA-256	8B66063F0D5458051CB6141122C336587FA900254412D07F27547379C1E55604

Key	Value
FileSize	1058914
MD5	8030F1CF102B2E547862D0E2653A3460
PackageDescription	a 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 contains the documentation files.
PackageMaintainer	Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageName	libghc6-agda-doc
PackageSection	doc
PackageVersion	2.2.6-7build1
SHA-1	1AFB83785C97151971F4181F96B0F79B254018FE
SHA-256	2E1D030C9EF37E02E4AFBA95B0C59443134A717DD5A2FA578E4FA2ABCF964BEA

Key	Value
FileSize	1058766
MD5	4138847715982C065F0EACFFF6D12D3A
PackageDescription	a 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 contains the documentation files.
PackageMaintainer	Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageName	haskell-agda-doc
PackageSection	doc
PackageVersion	2.2.6-3
SHA-1	6D586327FE3161D82C389294C38E842AA4E729EE
SHA-256	BD95B95D7B8A0CB27EA24D5210049668382A2744CE8ADB80F43EB406B06DEC51