Sciweavers

130 search results - page 15 / 26
» The Language Theory of Bounded Context-Switching
Sort
View
ICFP
2007
ACM
14 years 7 months ago
A type directed translation of MLF to system F
The MLF type system by Le Botlan and R?emy (2003) is a natural extension of Hindley-Milner type inference that supports full firstclass polymorphism, where types can be of higher-...
Daan Leijen
ICFP
2008
ACM
14 years 7 months ago
Typed closure conversion preserves observational equivalence
Language-based security relies on the assumption that all potential attacks are bound by the rules of the language in question. When programs are compiled into a different languag...
Amal Ahmed, Matthias Blume
TCS
2002
13 years 7 months ago
Binary (generalized) Post Correspondence Problem
An instance of the (Generalized) Post Correspondence Problem is during the decision process typically reduced to one or more other instances, called its successors. In this paper ...
Vesa Halava, Tero Harju, Mika Hirvensalo
ICFCA
2004
Springer
14 years 24 days ago
Automated Lattice Drawing
Lattice diagrams, known as Hasse diagrams, have played an ever increasing role in lattice theory and fields that use lattices as a tool. Initially regarded with suspicion, they no...
Ralph Freese
ICALP
2010
Springer
14 years 6 days ago
Automata for Coalgebras: An Approach Using Predicate Liftings
Universal Coalgebra provides the notion of a coalgebra as the natural mathematical generalization of state-based evolving systems such as (infinite) words, trees, and transition s...
Gaëlle Fontaine, Raul Andres Leal, Yde Venema