Paper: Full Abstraction and Expressive Completeness for FP (at LICS 1987)
Authors: Joseph Y. Halpern Edward L. Wimmers
Abstract
We consider issues related to the expressive power of FP. In particular, we consider whether a number of variants of FP are fully abstract and expressively complete. By considering these variants, we obtain a better understanding of what is required of a language and semantics in order to guarantee full abstraction and expressive completeness.
BibTeX
@InProceedings{HalpernWimmers-FullAbstractionandE, author = {Joseph Y. Halpern and Edward L. Wimmers}, title = {Full Abstraction and Expressive Completeness for FP}, booktitle = {Proceedings of the Second Annual IEEE Symposium on Logic in Computer Science (LICS 1987)}, year = {1987}, month = {June}, pages = {257--271 }, location = {Ithaca, NY, USA}, publisher = {IEEE Computer Society Press} }