meta.yml

fullname: Hoare Type Theory
shortname: htt
organization: imdea-software
opam_name: coq-htt-core
community: false
action: true
dune: true
coqdoc: false

synopsis: >-
  Hoare Type Theory
description: |-
  Hoare Type Theory (HTT) is a verification system for reasoning about sequential heap-manipulating
  programs based on Separation logic.

  HTT incorporates Hoare-style specifications via preconditions and postconditions into types. A
  Hoare type `ST P (fun x : A => Q)` denotes computations with a precondition `P` and postcondition
  `Q`, returning a value `x` of type `A`. Hoare types are a dependently typed version of monads,
  as used in the programming language Haskell. Monads hygienically combine the language features
  for pure functional programming, with those for imperative programming, such as state or
  exceptions. In this sense, HTT establishes a formal connection in the style of Curry-Howard
  isomorphism between monads and (functional programming variant of) Separation logic. Every
  effectful command in HTT has a type that corresponds to the appropriate non-structural inference
  rule in Separation logic, and vice versa, every non-structural inference rule corresponds to a
  command in HTT that has that rule as the type. The type for monadic bind is the Hoare rule for
  sequential composition, and the type for monadic unit combines the Hoare rules for the idle
  program (in a small-footprint variant) and for variable assignment (adapted for functional
  variables). The connection reconciles dependent types with effects of state and exceptions and
  establishes Separation logic as a type theory for such effects. In implementation terms, it means
  that HTT implements Separation logic as a shallow embedding in Coq.

build: |-
  ## Building and installation instructions

  The easiest way to install the latest released version of Hoare Type Theory
  is via [OPAM](https://opam.ocaml.org/doc/Install.html):

  ```shell
  opam repo add coq-released https://coq.inria.fr/opam/released
  opam install coq-htt
  ```

  To instead build and install manually, do:

  ``` shell
  git clone https://github.com/imdea-software/htt.git
  cd htt
  dune build
  dune install htt
  ```

  If you also want to build the examples, run `make` instead of `dune`.

authors:
- name: Aleksandar Nanevski
  initial: true
- name: Germán Andrés Delbianco
  initial: false
- name: Alexander Gryzlov
  initial: false
- name: Marcos Grandury
  initial: false

publications:
- pub_url: https://software.imdea.org/~aleks/papers/reflect/reflect.pdf
  pub_title: Structuring the verification of heap-manipulating programs
  pub_doi: 10.1145/1706299.1706331

maintainers:
- name: Alexander Gryzlov
  nickname: clayrat

opam-file-maintainer: fcsl@software.imdea.org

opam-file-version: dev

license:
  fullname: Apache-2.0
  identifier: Apache-2.0
  file: LICENSE

supported_coq_versions:
  text: Coq 8.19 to 8.20
  opam: '{ (>= "8.19" & < "8.21~") | (= "dev") }'

tested_coq_opam_versions:
- version: '2.2.0-coq-8.19'
  repo: 'mathcomp/mathcomp'
- version: '2.2.0-coq-8.20'
  repo: 'mathcomp/mathcomp'
- version: 'latest-coq-dev'
  repo: 'mathcomp/mathcomp'

dependencies:
- opam:
    name: coq-mathcomp-ssreflect
    version: '{ (>= "2.2.0" & < "2.3~") | (= "dev") }'
  description: |-
    [MathComp ssreflect 2.2](https://math-comp.github.io)
- opam:
    name: coq-mathcomp-algebra
  description: |-
    [MathComp algebra](https://math-comp.github.io)
- opam: 
    name: coq-mathcomp-fingroup
  description: |-
    [MathComp fingroup](https://math-comp.github.io)
- opam:
    name: coq-fcsl-pcm
    version: '{ (>= "2.0.0" & < "2.1~") | (= "dev") }'
  description: |-
    [FCSL-PCM 2.0](https://github.com/imdea-software/fcsl-pcm)

namespace: htt

keywords:
- name: partial commutative monoids
- name: separation logic

categories:
- name: Computer Science/Data Types and Data Structures

documentation: |-

  ## History

  The original version of HTT can be found [here](https://software.imdea.org/~aleks/htt/).

  ## References

  * [Dependent Type Theory of Stateful Higher-Order Functions](https://software.imdea.org/~aleks/papers/hoarelogic/depstate.pdf)

    Aleksandar Nanevski and Greg Morrisett. Technical report TR-24-05, Harvard University, 2005.

  * [Polymorphism and Separation in Hoare Type Theory](http://software.imdea.org/~aleks/htt/icfp06.pdf)

    Aleksandar Nanevski, Greg Morrisett and Lars Birkedal. ICFP 2006.

    The first paper containing a (very impoverished) definition of HTT.

  * [Hoare Type Theory, Polymorphism and Separation](http://software.imdea.org/~aleks/htt/jfpsep07.pdf)

    Aleksandar Nanevski, Greg Morrisett and Lars Birkedal. JFP 2007.

    Journal version of the ICFP 2006 paper.

  * [Abstract Predicates and Mutable ADTs in Hoare Type Theory](http://software.imdea.org/~aleks/htt/esop07.pdf)

    Aleksandar Nanevski, Amal Ahmed, Greg Morrisett, Lars Birkedal. ESOP 2007.

    Adding abstract predicates to HTT.

  * [A Realizability Model for Impredicative Hoare Type Theory](http://software.imdea.org/~aleks/htt/esop08.pdf)

    Rasmus L. Petersen, Lars Birkedal, Aleksandar Nanevski, Greg Morrisett. ESOP 2008.

    A semantic model for HTT, but without large sigma types.

  * [Ynot: Dependent Types for Imperative Programs](http://software.imdea.org/~aleks/htt/ynot08.pdf)

    Aleksandar Nanevski, Greg Morrisett, Avi Shinnar, Paul Govereau, Lars Birkedal. ICFP 2008.

    First implementation of HTT as a DSL in Coq, and a number of examples.

  * [Structuring the Verification of Heap-Manipulating Programs](http://software.imdea.org/~aleks/htt/reflect.pdf)

    Aleksandar Nanevski, Viktor Vafeiadis and Josh Berfine. POPL 2010.

    This paper introduces what is closest to the current structure of the implementation of HTT.
    It puts emphasis on structuring programs and proofs together, rather than on attacking the
    verification problem using proof automation. It carries out a large case study, verifying the
    congruence closure algorithm of the Barcelogic SAT solver.

    The current implementation differs from what's explained in this paper, in that it uses unary,
    rather than binary postconditions.

  * [Partiality, State and Dependent Types](http://software.imdea.org/~aleks/htt/tlca11.pdf)

    Kasper Svendsen, Lars Birkedal and Aleksandar Nanevski. TLCA 2011.

    A semantic model for HTT, with large sigma types.