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
FileSize	44642
MD5	A694C3026AEE390E25699FB428645939
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	agda-mode
PackageSection	misc
PackageVersion	2.3.2.1-1
SHA-1	C53BEB3844B9FEE8D8536C05FA8FB79FA8845767
SHA-256	52F48B35265A2CA7291A924630AB57508D9D046075CB1669F5B2660B8A523101

Key	Value
MD5	AD7A09A0AFEEE4CD06AEEDBA2FA3D4EA
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	emacs-agda-el
PackageRelease	5.el7
PackageVersion	2.3.2.2
SHA-1	E3C4ECFCE9451232FA524FE91DFC84633DEEC56C
SHA-256	7951F3D2088C2B1C828C1A7AF149B2CEBBA2DB9D444235805956ABC14A24B01C

Key	Value
FileSize	45468
MD5	CD60AFFB78FB775669963C3755B74DF6
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	agda-mode
PackageSection	misc
PackageVersion	2.3.2-1
SHA-1	9B4BF36E9605D5CF286F02A6337D21E92B55222B
SHA-256	3737C76C32B8D03EAA6D684781BD4ABC230A5893FC3956FF9DEA9BF87AAC882E

Key	Value
FileSize	48080
MD5	55D29847A1814A691B2C476EDED980C7
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	agda-mode
PackageSection	misc
PackageVersion	2.3.2.2-1
SHA-1	B1B682A4A3CD43974857336490653EC071BE20EB
SHA-256	256EA59AFF33FFE0F08FE99C120926EEBA67D1C3FE89C51D3EB3D8C879EF0E32