| Key | Value |
|---|---|
| FileName | ./usr/share/doc/libghc-agda-doc/changelog.Debian.gz |
| FileSize | 3789 |
| MD5 | 608AF2E3C4C9121245F1C95EC4A41B9E |
| SHA-1 | 05F5AC0E30F290C146A9A04C6B4FCA4E14A934AA |
| SHA-256 | 936719ECB3E53418EE55FD8895E1794305710E11CCC1A72675DC454A2B10D1C1 |
| SSDEEP | 96:N2NRBH+9n2i0I8x9WYoSlVl6xWv5vLoNBS:KLs2i0F9W/KloWvRLGS |
| TLSH | T127715BBA5089C4FB16EBA5BA01E30319E0C7A76FC856199A3663417FF60834CB0A585E |
| hashlookup:parent-total | 7 |
| hashlookup:trust | 85 |
The searched file hash is included in 7 parent files which include package known and seen by metalookup. A sample is included below:
| Key | Value |
|---|---|
| FileSize | 3769532 |
| MD5 | 3851088AC32CA141A8FD8AEA0ABFE245 |
| PackageDescription | commandline 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. |
| PackageMaintainer | Debian Haskell Group <pkg-haskell-maintainers@lists.alioth.debian.org> |
| PackageName | agda-bin |
| PackageSection | haskell |
| PackageVersion | 2.4.0.2-2+b1 |
| SHA-1 | 12BB42903F031A57F077B1F9E935CC34E8BA7229 |
| SHA-256 | F381F12BCF8B3D9329D1479E08CD3E3B2FA22E19DE518E5937D71942325F574A |
| Key | Value |
|---|---|
| FileSize | 3920024 |
| MD5 | B36FED377CE77B3C892C506ABC96E429 |
| PackageDescription | commandline 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. |
| PackageMaintainer | Debian Haskell Group <pkg-haskell-maintainers@lists.alioth.debian.org> |
| PackageName | agda-bin |
| PackageSection | haskell |
| PackageVersion | 2.4.0.2-2+b1 |
| SHA-1 | B1F94507CCE72C8218613E909F7B4AF6E8872413 |
| SHA-256 | 06292CE2DDA51E4A1BAFDF231E6285238F04F08F9B273734F45FD61F01DCBFFD |
| Key | Value |
|---|---|
| FileSize | 1959856 |
| MD5 | 8C3AA8AAEB23AC53DA0A9D5A6F7567FF |
| 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.4.0.2-2 |
| SHA-1 | 2C94E785BB412E68C66B074C44DACEF0FA313DC5 |
| SHA-256 | 7412AF0D3277C552DF76923504FDFD5DF283E57CD36E93A027E3534DB9AF429C |
| Key | Value |
|---|---|
| FileSize | 9793172 |
| MD5 | 491833EA297562972B90FA4A7235AF2D |
| 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 package provides 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-dev |
| PackageSection | haskell |
| PackageVersion | 2.4.0.2-2+b1 |
| SHA-1 | 8716F7513F9E716A9D984CDC0477A4FE53CAEE83 |
| SHA-256 | 458F57944C6B8A7E01C5ABCE3172BA80497F96EC466C61FBB32685D02607497A |
| Key | Value |
|---|---|
| FileSize | 56362 |
| MD5 | 6F06A8F18CFECF7CF37FCB3CB5252A5A |
| 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.4.0.2-2 |
| SHA-1 | F99A9E07E7D96EF507830D62CCA9A75C7E5AC94B |
| SHA-256 | D5201F682C2D0CDB32283FEB47778824D2DF56BEF80D0D4B11AA0F643CEAB5FB |
| Key | Value |
|---|---|
| FileSize | 88336 |
| MD5 | FBE90088FD0B5E99499042943328AD0C |
| 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 | agda-mode |
| PackageSection | misc |
| PackageVersion | 2.4.0.2-2 |
| SHA-1 | FCD8314BC96EE0C95F77724469B985C76FFA5C44 |
| SHA-256 | FAA7A61902FB1E38F7B788BF2CAE0880D73B8984177E7BADC6930084120B234F |
| Key | Value |
|---|---|
| FileSize | 9676072 |
| MD5 | 694C075845EE486EAF31F8D1CA4F8C83 |
| 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 package provides 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-dev |
| PackageSection | haskell |
| PackageVersion | 2.4.0.2-2+b1 |
| SHA-1 | 78AADBFFA2913346A1B88DB9C44D70FFCCB7FBD7 |
| SHA-256 | A3A914C8F2BD8B9A83A98B28006E7DDA7D5815663829EB5FCDDC0F7514894357 |