Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
9657957 | Theoretical Computer Science | 2005 | 32 Pages |
Abstract
We also carry out a theoretical examination of the failures class. We prove that the class forms a complete lattice, and investigate the positions of particular models within that lattice. We also identify the maximal subset of the language over which each model is compositional.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Christie Bolton, Gavin Lowe,