After the success of the first edition, Introduction to Functional Programming using Haskell
has been thoroughly updated and revised to provide a complete grounding in the principles …

Publisher Summary From the early 1930s, there evolved two kinds of mathematical
semantics for modal logic. Algebraic semantics interprets modal connectives as operators …

How can we integrate interaction into a purely declarative language? This tutorial describes
a solution to this problem based on a monad. The solution has been implemented in the …

This book is a textbook in basic category theory, written specifically to be read by
researchers and students in computing science. We expound the constructions we feel are …

This text is based on the chapter Domain Theory in the Handbook for Logic in Computer
Science, volume 3, edited by S. Abramsky, Dov M. Gabbay, and TS E. Maibaum, published …

An introduction to category theory as a rigorous, flexible, and coherent modeling language
that can be used across the sciences. Category theory was invented in the 1940s to unify …

In these lecture notes we describe an algebraic approach to programming, suitable both for
the derivation of individual programs and for the study of programming techniques in …

Propositions as types Page 1 DECEMBER 2015 | VOL. 58 | NO. 12 | COMMUNICATIONS OF
THE ACM 75 DOI:10.1145/2699407 Connecting mathematical logic and computation, it …

Interaction trees (ITrees) are a general-purpose data structure for representing the behaviors
of recursive programs that interact with their environments. A coinductive variant of “free …

Nominal sets provide a promising new mathematical analysis of names in formal languages
based upon symmetry, with many applications to the syntax and semantics of programming …