enter search term and/or author name
Fast: A Transducer-Based Language for Tree Manipulation
Loris D'antoni, Margus Veanes, Benjamin Livshits, David Molnar
Article No.: 1
Tree automata and transducers are used in a wide range of applications in software engineering. While these formalisms are of immense practical use, they can only model finite alphabets. To overcome this problem we augment tree automata and...
A Dynamic Continuation-Passing Style for Dynamic Delimited Continuations
Dariusz Biernacki, Olivier Danvy, Kevin Millikin
Article No.: 2
We put a preexisting definitional abstract machine for dynamic delimited continuations in defunctionalized form, and we present the consequences of this adjustment. We first prove the correctness of the adjusted abstract machine. Because it is in...
We consider a type algebra equipped with recursive, product, function, intersection, union, and complement types, together with type variables. We consider the subtyping relation defined by Castagna and Xu  over such type expressions and...