Formalizing abstract characteristics of style

Formalizing Implementation Strategies for First-Class Continuations

We present the first formalization of implementation strategies for first-class continuations. The formalization hinges on abstract machines for continuation-passing style (CPS) programs with a special treatment for the current continuation, accounting for the essence of first-class continuations. These abstract machines are proven equivalent to a standard, substitution-based abstract machine. ...

Formalizing a Lazy Substitution Proof System for µ-calculus in the Calculus of Inductive Constructions

We present a Natural Deduction proof system for the propositional modal μ-calculus, and its formalization in the Calculus of Inductive Constructions. We address several problematic issues, such as the use of higher-order abstract syntax in inductive sets in presence of recursive constructors, the encoding of modal (sequent-style) rules and of context sensitive grammars. The formalization can be...

Formalizing natural deduction with assumption bases

We introduce NDL, a new formalization of Fitch-style natural deduction based on the abstraction of assumption bases. NDL proofs tend to be readable, writable, concise, and can be checked very efficiently. We present the abstract syntax of NDL, followed by two different kinds of formal semantics: evaluation and denotational. We then relate the two semantics and show how proof checking becomes ta...

Formalizing On Chip Communications in a Functional Style

An Exercise in Formalizing the Description of a Concurrent System

LOTOS is one of the most recent formal description languages to appear and one of very few with a standard definition. It has both a process algebra and an abstract data-type component, and these facilities are used in combination to describe the behaviour of concurrent systems. The purpose of this paper is to examine, in a tutorial style, what is involved in constructing and taking benefit fro...