We investigate some syntactic properties of Wadler’s dual calculus, a term calculus which corresponds to classical sequent logic in the same way that Parigot’s λµ calculus co...
Daniel J. Dougherty, Silvia Ghilezan, Pierre Lesca...
We investigate rule dependency graphs and their colorings for characterizing the computation of answer sets of logic programs. To this end, we develop a series of operational chara...
Static analyses of object-oriented programs usually rely on intermediate representations that respect the original semantics while having a more uniform and basic syntax. Most of t...
Calculi with explicit substitutions (ES) are widely used in different areas of computer science. Complex systems with ES were developed these last 15 years to capture the good comp...
History based models, introduced by Parikh and Ramanujam, provide a natural mathematical model of social interactive situations. These models offer a ”low level” description ...