Predicate Transformers and Linear Logic, yet another denotational model
| dc.creator | Hyvernat, Pierre | |
| dc.date | 2009-05-25 | |
| dc.date.accessioned | 2026-07-07T13:17:54Z | |
| dc.date.available | 2026-07-07T13:17:54Z | |
| dc.description | In the refinement calculus, monotonic predicate transformers are used to model specifications for (imperative) programs. Together with a natural notion of simulation, they form a category enjoying many algebraic properties. We build on this structure to make predicate transformers into a de notational model of full linear logic: all the logical constructions have a natural interpretation in terms of predicate transformers (i.e. in terms of specifications). We then interpret proofs of a formula by a safety property for the corresponding specification. | |
| dc.identifier | https://arxiv.org/abs/0905.3998 | |
| dc.identifier | http://arxiv.org/abs/0905.3998 | |
| dc.identifier | Computer Science and Logic 2004, Karpacz : Pologne (2004) | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/231265 | |
| dc.subject | Logic in Computer Science | |
| dc.subject | Logic | |
| dc.title | Predicate Transformers and Linear Logic, yet another denotational model | |
| dc.type | text |