In this paper we consider Idempotent Functional Analysis, an 'abstract' version of Idempotent Analysis developed by V. P. Maslov and his collaborators. We give a review of the basic ideas of Idempotent Analysis. The correspondence between concepts and theorems of the traditional Functional Analysis and its idempotent version is discussed; this correspondence is similar to N. Bohr's corresponden...

Event-driven programming is based on a natural abstraction: an event is a computation that can eventually return a value. This paper exploits the intuition relating events and time by drawing a Curry-Howard correspondence between a functional event-driven programming language and a linear-time temporal logic. In this logic, the eventually proposition ♦A describes the type of events, and Girard’...