125
click to vote
FOSSACS
2016
Springer
10 years 1 months ago
2016
Springer
We investigate the complexity of deciding contextual approximation (refinement) in finitary Idealized Algol, a prototypical language combining higherorder types with state. Earli...
237
click to vote
FOSSACS
2016
Springer
10 years 1 months ago
2016
Springer
We give a characterization of deterministic polynomial time computation based on an algebraic structure called the resolution semiring (whose elements can be understood as logic pr...
244
click to vote
FOSSACS
2016
Springer
10 years 1 months ago
2016
Springer
We reformulate the bar recursion and induction principles in terms of recursive and wellfounded coalgebras. Bar induction was originally proposed by Brouwer as an axiom to recover ...
120
click to vote
FOSSACS
2016
Springer
10 years 1 months ago
2016
Springer
Recently, a number of reversible functional programming languages have been proposed. Common to several of these is the assumption of totality, a property that is not necessarily d...
132
click to vote
FOSSACS
2016
Springer
10 years 1 months ago
2016
Springer
This paper is concerned with Freeze LTL, a temporal logic on data words with registers. In a (multi-attributed) data word each position carries a letter from a finite alphabet and...