Conference paper
Counterexample to theorems of Cox and Fine
Joseph Y. Halpern
aaai 1996
Many apparently divergent approaches to specifying formal semantics of programming languages are applications of initial algebra semantics. In this paper an overview of initial algebra semantics is provided. The major technical feature is an initial continuous algebra which permits unified algebraic treatment of iterative and recursive semantic features in the same framework as more basic operations. © 1977, ACM. All rights reserved.
Joseph Y. Halpern
aaai 1996
Daniel Karl I. Weidele, Hendrik Strobelt, et al.
SysML 2019
Lars Graf, Thomas Bohnstingl, et al.
NeurIPS 2025
Bemali Wickramanayake, Zhipeng He, et al.
Knowledge-Based Systems