Conference paper
Counterexample to theorems of Cox and Fine
Joseph Y. Halpern
aaai 1996
The authors consider issues related to the expressive power of the functional programming (FP) language. In particular, they consider whether a number of variants of FP are fully abstract and expressively complete. By considering these variants, a better understanding is obtained of what is required of a language and semantics in order to guarantee full abstraction and expressive completeness.
Joseph Y. Halpern
aaai 1996
Joseph Y. Halpern
aaai 1993
Moshe Y. Vardi, Pierre Wolper
LICS 1986
Joseph Y. Halpern, Yoram Moses, et al.
PODC 1990