Equational properties of stratified least fixed points
Logic in Computer Science
2015-12-11 v5
Abstract
Recently, a novel fixed point operation has been introduced over certain non-monotonic functions between stratified complete lattices and used to give semantics to logic programs with negation and boolean context-free grammars. We prove that this new operation satisfies `the standard' identities of fixed point operations as described by the axioms of iteration theories. We also study this new fixed point operation in connection with lambda-abstraction.
Keywords
Cite
@article{arxiv.1410.8111,
title = {Equational properties of stratified least fixed points},
author = {Zoltan Esik},
journal= {arXiv preprint arXiv:1410.8111},
year = {2015}
}