Skip to content
GitLab
Projects Groups Topics Snippets
  • /
  • Help
    • Help
    • Support
    • Community forum
    • Submit feedback
    • Contribute to GitLab
  • Register
  • Sign in
  • S stdpp
  • Project information
    • Project information
    • Activity
    • Labels
    • Members
  • Repository
    • Repository
    • Files
    • Commits
    • Branches
    • Tags
    • Contributor statistics
    • Graph
    • Compare revisions
  • Issues 82
    • Issues 82
    • List
    • Boards
    • Service Desk
    • Milestones
  • Merge requests 11
    • Merge requests 11
  • CI/CD
    • CI/CD
    • Pipelines
    • Jobs
    • Schedules
  • Deployments
    • Deployments
    • Releases
  • Analytics
    • Analytics
    • Value stream
    • CI/CD
    • Repository
  • Wiki
    • Wiki
  • Activity
  • Graph
  • Create a new issue
  • Jobs
  • Commits
  • Issue Boards
Collapse sidebar
  • Iris
  • stdpp
  • Issues
  • #85
Closed
Open
Issue created Oct 05, 2020 by Tej Chajed@tchajedMaintainer

Experiment with SProp to make gmap operations compute nicely

Currently both Pmap and gmap are sigma types of the form {x:T | Is_true (wf x : bool)}. If they were instead written {x:T | sis_true (wf x : bool) : SProp} (using sis_true (b:bool) : SProp := if b then sUnit else sEmpty), then the well-formedness proof would be in SProp. This gives not just proof irrelevance but definitional proof irrelevance, which I think means proofs will compute away properly when reducing gmap operations in Coq.

Assignee
Assign to
Time tracking