FOSSACS 2010 | Sciweavers

17

FOSSACS
2010
Springer

194views Software Engineering» more FOSSACS 2010»

A Hierarchy for Delimited Continuations in Call-by-Name

13 years 11 months ago

Λµ-calculus was introduced as a Böhm-complete extension of Parigot's λµ-calculus. Λµ-calculus, contrarily to Parigot's calculus, is a calculus of CBN delimited con...

Alexis Saurin

claim paper

Read More »

11

click to vote

FOSSACS
2010
Springer

187views Software Engineering» more FOSSACS 2010»

Coalgebraic Correspondence Theory

13 years 11 months ago

Download www.informatik.uni-bremen.de

Abstract. We lay the foundations of a ﬁrst-order correspondence theory for coalgebraic logics that makes the transition structure explicit in the ﬁrst-order modelling. In parti...

Lutz Schröder, Dirk Pattinson

claim paper

Read More »

13

click to vote

FOSSACS
2010
Springer

165views Software Engineering» more FOSSACS 2010»

Algorithmic Metatheorems for Decidable LTL Model Checking over Infinite Systems

13 years 11 months ago