2 Technical background 4 2.1 Martin-Löf Type Theory . . . . . . . . . . . . . . . . . . . . . . . 4 2.1.1 Intuition . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 2.1.2 Kinds of judgments . . . . . . . . . . . . . . . . . . . . . . 7 2.1.3 Rules for context formation and substitution . . . . . . . 8 2.1.4 Congruence rules for definitional equality . . . . . . . . . 9 2.1.5 Rules for ...

1. Introduction The Budapest Unification Grammar (BUG) system described in this paper is a system for generating natural language parsers from feature-structure based grammatical descriptions (graamnars). In the current version, source grammars are limited to the context-free phrase structure grammar format. BuG compiles source grmnmars into automata, which it can then use for parsing input str...

This first year report details the background, and motivation to the hypothesis : ”It is more efficient in terms of energy consumption to relay traffic through a set of nodes than to modify the transmission power [or move].”. Set out in this report are a series of experiments designed to test the hypothesis in a hostile environment where the collection of nodes have a collective task to carry o...