Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
I
ITree Program Logic
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Wiki
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Snippets
Build
Pipelines
Jobs
Pipeline schedules
Artifacts
Deploy
Releases
Package registry
Model registry
Operate
Environments
Terraform modules
Monitor
Incidents
Service Desk
Analyze
Value stream analytics
Contributor analytics
CI/CD analytics
Repository analytics
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
Community forum
Contribute to GitLab
Provide feedback
Terms and privacy
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
Iris
ITree Program Logic
Repository graph
Repository graph
You can move around the graph by using the arrow keys.
master
Select Git revision
Branches
3
hl2
hl2_cat
master
default
3 results
Begin with the selected commit
Created with Raphaël 2.2.0
26
May
25
8
7
29
Apr
28
24
23
22
11
10
9
7
3
2
1
3
Mar
27
Nov
21
20
18
8
7
31
Oct
28
26
25
20
18
16
15
14
13
10
3
30
Aug
29
Jul
26
25
23
12
11
9
8
7
5
4
3
2
26
Jun
25
24
23
22
21
20
19
18
17
14
13
12
11
10
7
6
30
May
27
24
23
22
17
16
12
11
10
9
8
7
6
5
4
3
1
30
Apr
26
24
23
22
19
3
2
1
28
Mar
27
25
22
20
19
18
13
6
5
4
9
Feb
8
7
Jan
26
Dec
25
19
18
17
14
12
8
6
5
4
30
Nov
29
21
26
Oct
25
9
5
3
28
Sep
27
12
9
5
29
Aug
19
18
15
11
10
9
8
7
3
2
1
31
Jul
2
1
30
Jun
29
28
27
26
24
23
22
12
11
9
8
Add typeclass infrastructure for determining if Σ is compatible with a LogExts.
hl2_cat
hl2_cat
Begin adding infrasturcture for constrainting `Σ`.
Switch to `gFunctors`-esque list-based approached instead of categorical approach.
This is where I give up on fighting universe issues.
Setup category theory for `LogExt`.
Set up category theory background for semantic extensions.
Fix build.
Prove needed inversion lemmata for `ReSumC`.
Implement missing type-classes for `HomSynExt`.
Prove that the resum solver actually builds an isomorphism (will be useful later).
Add heap language extension.
Add new resum solver which keeps track of identification with sum.
Finish adding atomic blocks to HeapLang 2.0.
Start adding atomic blocks to HeapLang 2.0.
Add abstractions for doing atomic blocks.
Begin implementing heap language extension.
Port program logic, use typeclasses for fixing "global" semantic/syntactic extension.
Fix bind lemma.
Bail on previous two approaches: use an amalgamation between categorical and list-based approach.
Begin to move away from categorical approach to "fixed universe" approach.
hl2
hl2
Add partial implementation of extensible lambda calculus.
Update Iris version.
master
master
mention affiliation in copyright
fix some footnote references
fix markdown
make more things links
make readme link to paper website
Merge branch 'master' of https://gitlab.mpi-sws.org/iris/itree-program-logic
enable CI here
Add Coq/paper mapping.
remove leftover files
Merge branch 'master' of gitlab.inf.ethz.ch:ou-plf/iris-itree
Update ExampleLang formalization to paper.
add license
add LICENSE to islaris
Merge branch 'master' of gitlab.inf.ethz.ch:ou-plf/iris-itree
Use `solve_ndisj` one more place.
bump dependencies and fix build
Add `spinlock` to `_CoqProject`.
Use `solve_ndisj` tactic instead of manual reasoning.
Loading