We define a set of deterministic bottom-up left to right parsers which analyze a subset of Tree Adjoining Languages. The LR parsing strategy for Context Free Grammars is extended ...
An extension of the -calculus called BS is introduced as a formal basis for functional languages expressing bulk synchronous parallel algorithms. A con uence result is shown. The ...
Abstract. We provide a formal scripting language to capture the semantics of market mechanisms. The language is based on a set of welldefined principles, and is designed to captur...