ENTCS
2002
14 years 13 days ago
2002
ENTCS
2002
14 years 13 days ago
2002
Walukiewicz gave in 1996 a solution for parity games on pushdown graphs: he proved the existence of pushdown strategies and determined the winner with an EXPTIME procedure. We giv...
ENTCS
2002
14 years 13 days ago
2002
The past decade has seen an explosion of work on calculi of explicit substitutions. Numerous work has illustrated the usefulness of these calculi for practical notions like the im...
ENTCS
2002
14 years 15 days ago
2002
d Abstract) Naoshi Tabuchi Eijiro Sumii Akinori Yonezawa 1 Department of Computer Science, Graduate School of Information Science and Technology, University of Tokyo We present re...
ENTCS
2002
14 years 15 days ago
2002
We compare Meyer and Routley's minimal relevant logic B+ with the recent semanticsbased approach to subtyping introduced by Frisch, Castagna and Benzaken in the definition of...
ENTCS
2002
14 years 15 days ago
2002
We present a calculus for modelling "environment-aware" computations, that is computations that adapt their behaviour according to the capabilities of the environment. T...
ENTCS
2002
14 years 16 days ago
2002
By using intersection types and filter models we formulate a theory of types for a -calculus with record subtyping via a finitary programming logic. Types are interpreted as space...
ENTCS
2002
14 years 16 days ago
2002
The paper presents approaches to the validation of optimizing compilers. The emphasis is on aggressive and architecture-targeted optimizations which try to obtain the highest perf...
ENTCS
2002
14 years 16 days ago
2002
ENTCS
2002
14 years 16 days ago
2002
Classically, any absolute continuous real function is of bounded variation and hence can always be expressed as a difference of two increasing continuous functions (socalled Jorda...