Result for 78C6D4A8312A60B8D1E49DFF37AD7A62591DB220

Query result

Key Value
FileName./usr/share/doc/libghc-agda-doc/changelog.gz
FileSize1313
MD5BB08E24371D822026840FDEAC39F2210
SHA-178C6D4A8312A60B8D1E49DFF37AD7A62591DB220
SHA-2569A8176789EBCC76672B2339DA61C22152F81871C712F7047867860C2385038B9
SSDEEP24:X+ZFtrm1EzFce68tV9EV9OJg8LMY0olhDsWjs0p8QROp04vROfGG7Nf29u/H:XIFICFceNV9E6JXLZ0olhDsWo0POayO/
TLSHT15A21F8235A0870B4792E07322C93499B7298F82B792CFB050D0FA8A969C1DD86AD70C6
hashlookup:parent-total5
hashlookup:trust75

Network graph view

Parents (Total: 5)

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

Key Value
FileSize7751992
MD55F8D9A83270B77FDE6510D2860D08F5A
PackageDescriptioncommandline interface to Agda 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 a command-line program for type-checking and compiling Agda programs. The program can also generate hyperlinked, highlighted HTML files from Agda sources.
PackageMaintainerDebian Haskell Group <pkg-haskell-maintainers@lists.alioth.debian.org>
PackageNameagda-bin
PackageSectionhaskell
PackageVersion2.6.2.2-1.1
SHA-12B8828FDBE83625C84C4AF70EC9E8AA476851B56
SHA-2568E4C39FD316F8B91800BEA9B4AC580FACC23C83030662C928031F1A9C2634466
Key Value
FileSize24853036
MD5A827C1F62CB35F810525E042DA8A4B4E
PackageDescriptiondependently 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 package provides a library for the Haskell programming language. See http://www.haskell.org/ for more information on Haskell.
PackageMaintainerDebian Haskell Group <pkg-haskell-maintainers@lists.alioth.debian.org>
PackageNamelibghc-agda-dev
PackageSectionhaskell
PackageVersion2.6.2.2-1.1
SHA-19C7642EEE4646AA11A4215B9C6249C43E53C882A
SHA-2563B1E6380DC53A3CF5F628F3A537AF8BE654E881A1F7C4409E108A59ED7E2C360
Key Value
FileSize12304
MD55C4D7458DC75886A83635C8A491B7461
PackageDescriptiondependently 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.
PackageMaintainerDebian Haskell Group <pkg-haskell-maintainers@lists.alioth.debian.org>
PackageNameagda
PackageSectionmisc
PackageVersion2.6.2.2-1.1
SHA-10C1F3C29F404694A3B507A89A0AB979FF915DED5
SHA-256BD7E666748A562513DC5E9623F3E3AB02AC4097236E5E8C08BC822205CB59E2A
Key Value
FileSize6599972
MD5C19198383A70DB09BBC60BE6B8B511C6
PackageDescriptiondependently 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.
PackageMaintainerDebian Haskell Group <pkg-haskell-maintainers@lists.alioth.debian.org>
PackageNamelibghc-agda-doc
PackageSectiondoc
PackageVersion2.6.2.2-1.1
SHA-1D6DD3F51B1C3B4EBB90105D62FB9A70239978BD8
SHA-2563C8A0135087B19A9B89361CEF625CA8B1425BB65942BBA7596CABBDAE6DBDACC
Key Value
FileSize50944
MD5BD179CF14CDA2901CE9AED789B376D7B
PackageDescriptiondependently 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.
PackageMaintainerDebian Haskell Group <pkg-haskell-maintainers@lists.alioth.debian.org>
PackageNameelpa-agda2-mode
PackageSectioneditors
PackageVersion2.6.2.2-1.1
SHA-1997F29394E13F6D062C319DDEEB2074A9BBF54D8
SHA-2562C2025905A45C8AF4BE594584430D76645AD3A42D82D873EF20B44F8B5A46AF4