Stronger compositions for retrenchments

R. Banach; C. Jeske

doi:10.1016/j.jlap.2009.10.002

Stronger compositions for retrenchments

Research output: Contribution to journal › Article › peer-review

Abstract

Noting that the usual 'propositionally' based way of composing retrenchments can yield many 'junk' cases, alternative approaches to composition are introduced (via notions of tidy, neat, and fastidious retrenchments) that behave better in this regard. These alternatives do however make other issues such as associativity harder. The technical details are presented for vertical composition of retrenchments (i.e. the composition of successive retrenchment steps). © 2009 Elsevier Inc. All rights reserved.

Original language	English
Pages (from-to)	215-232
Number of pages	17
Journal	Journal of Logic and Algebraic Programming
Volume	79
Issue number	3-5
DOIs	https://doi.org/10.1016/j.jlap.2009.10.002
Publication status	Published - Apr 2010

Keywords

Associativity
Composition
Retrenchment

Access to Document

10.1016/j.jlap.2009.10.002

Cite this

@article{a1ffb9c6449b4f5caa3806ad65615ff7,

title = "Stronger compositions for retrenchments",

abstract = "Noting that the usual 'propositionally' based way of composing retrenchments can yield many 'junk' cases, alternative approaches to composition are introduced (via notions of tidy, neat, and fastidious retrenchments) that behave better in this regard. These alternatives do however make other issues such as associativity harder. The technical details are presented for vertical composition of retrenchments (i.e. the composition of successive retrenchment steps). {\textcopyright} 2009 Elsevier Inc. All rights reserved.",

keywords = "Associativity, Composition, Retrenchment",

author = "R. Banach and C. Jeske",

year = "2010",

month = apr,

doi = "10.1016/j.jlap.2009.10.002",

language = "English",

volume = "79",

pages = "215--232",

journal = "Journal of Logic and Algebraic Programming",

issn = "1567-8326",

publisher = "Elsevier BV",

number = "3-5",

}

TY - JOUR

T1 - Stronger compositions for retrenchments

AU - Banach, R.

AU - Jeske, C.

PY - 2010/4

Y1 - 2010/4

N2 - Noting that the usual 'propositionally' based way of composing retrenchments can yield many 'junk' cases, alternative approaches to composition are introduced (via notions of tidy, neat, and fastidious retrenchments) that behave better in this regard. These alternatives do however make other issues such as associativity harder. The technical details are presented for vertical composition of retrenchments (i.e. the composition of successive retrenchment steps). © 2009 Elsevier Inc. All rights reserved.

AB - Noting that the usual 'propositionally' based way of composing retrenchments can yield many 'junk' cases, alternative approaches to composition are introduced (via notions of tidy, neat, and fastidious retrenchments) that behave better in this regard. These alternatives do however make other issues such as associativity harder. The technical details are presented for vertical composition of retrenchments (i.e. the composition of successive retrenchment steps). © 2009 Elsevier Inc. All rights reserved.

KW - Associativity

KW - Composition

KW - Retrenchment

U2 - 10.1016/j.jlap.2009.10.002

DO - 10.1016/j.jlap.2009.10.002

M3 - Article

SN - 1567-8326

VL - 79

SP - 215

EP - 232

JO - Journal of Logic and Algebraic Programming

JF - Journal of Logic and Algebraic Programming

IS - 3-5

ER -

Stronger compositions for retrenchments

Abstract

Keywords

Access to Document

Fingerprint

Cite this