Skip to content
Snippets Groups Projects

Repository graph

You can move around the graph by using the arrow keys.
Select Git revision
  • ci/debug
  • ci/for_proph
  • ci/general-contractive
  • ci/hai/siProp
  • ci/janno/strict-tc-resolution
  • ci/msammler/nb_state
  • ci/ralf/Z_of_nat
  • ci/ralf/bi-language
  • ci/robbert/big_op_binder
  • ci/robbert/contractive_ne
  • ci/robbert/coq_bug_7773
  • ci/robbert/faster_iDestruct
  • ci/robbert/faster_iDestruct2
  • ci/robbert/faster_iFresh_joe
  • ci/robbert/frame_fractional
  • ci/robbert/iFrame
  • ci/robbert/into_fupd
  • ci/robbert/into_val_pures
  • ci/robbert/kill_locked_value_lambdas
  • ci/robbert/mapsto_persist
  • iris-4.0.0
  • iris-3.6.0
  • iris-3.5.0
  • iris-3.4.0
  • iris-3.3.0
  • iris-3.2.0
  • iris-3.1.0
  • iris-3.0.0
  • iris-2.0
  • iris-2.0-rc2
  • iris-2.0-rc1
  • iris-1.1
  • iris-1.0
  • hope-2015-coq-1
  • appendix-1.0.0
  • appendix-1
36 results
Created with Raphaël 2.2.025May2423222018161514131211875129Apr28262524232219181615149876432131Mar272523212019181613121096428Feb262524232120191817151413121110765432130Jan29242321181716151413111098720Dec19181413109654225Nov222120141312111087652131Oct2522181412119620Sep19131198630Aug29282726252422161413Add lemma `intuitionistically_impl_wand_2 P Q : □ (P -∗ Q) ⊢ □ (P → Q)`.rename array_tools -> array; update CHANGELOGMerge branch 'robbert/cleanup' into 'master'Make `[#]` produce goal with `<pers>` modality if premise is not persistent.ci/robbert/iFrameci/robbert/iFrameBetter `Make*` instances that clean up redundant modalities in the spine of a frame.More general instance for framing under `<affine>`.Fine-grained split of `class_instances` based on the structure of the `bi` folder.Reorganize `big_op` file to remove `sbi` section.Reorganize `coq_tactics` file to remove `sbi` section.Rename `derived_laws_bi` → `derived_laws` and `derived_laws_sbi` → `derived_laws_later`.Merge branch 'ci/robbert/merge_sbi_new' into 'master'Merge branch 'robbert/done' into 'master'CHANGELOG entry.Comment for `internal_eq` file.Comment about `BiLaterMixin`.Explain axiom `⎡P⎤ ≡ ⎡Q⎤ ⊢@{PROP'} (P ≡ Q)` of embeddings.Add test file for a simple non step-indexed linear separation logic.Remove `Local` that is incompatible with Coq 8.9.Add smart constructor `BiMixin → BiLaterMixin`.Use type class for internal equality.Comment about `BiLöb`.Tweak error message and test case of `iLöb`.Add instances for Löb and contractiveness of later for monPred.Merge sbi canonical structure into the bi canonical structure.clarify commentMore documentation on `done`.test wp_freeapply review suggestionstest setoid_rewrite on inv_mapstomake inv_mapsto for heap_lang proper definitions because they are higher-orderMerge branch 'master' into 'master'Coqify the comments.Fix notation in commentscopy all gen_heap and gen_inv_heap mapsto lemmas, and name variablesCHANGELOG, update gen_inv_heap commentdefine and prove array_freeadd lifting lemma and tactic for single-location Freeadd single-location Free operation to language syntax and semanticsnote some design choicesmake heap store (option val) in preparation for deallocation