Search for dissertations about: "fixed-point computations"
Showing result 1 - 5 of 9 swedish dissertations containing the words fixed-point computations.
-
1. Object-Oriented Declarative Program Analysis
Abstract : This thesis deals with techniques for raising the programming level for a particular kind of computations, namely those on abstract syntax trees. Such computations are central in many program analysis tools, such as compilers, smart language-sensitive editors, and static analysis tools. READ MORE
-
2. Applications and Extensions of Reference Attributed Grammars
Abstract : Programming languages are the main tools used to describe models of the real world and algorithms which manipulate these models. Over time much effort has been devoted to the task of making programming languages more high-level by enhancing their expressiveness, bringing it closer to the way the programmer thinks and reasons. READ MORE
-
3. Supersymmetry, branes and the mysterious M
Abstract : String theory is the only known theory that unifies general relativity and quantum mechanics in a consistent way. In recent years there has been a dramatic progress in the understanding of the non-perturbative aspects of string theory. It is now believed that string theory is part of a larger theory called M-theory. READ MORE
-
4. ASIP for Wireless Communication and Media
Abstract : While general purpose processors reach both high performance and high application flexibility, this comes at a high cost in terms of silicon area and power consumption. In systems where high application flexibility is not required, it is possible to trade off flexibility for lower cost by tailoring the processor to the application to create an Application Specific Instruction set Processor (ASIP) with high performance yet low silicon cost. READ MORE
-
5. Types for XML with Application to Xcerpt
Abstract : XML data is often accompanied by type information, usually expressed by some schema language. Sometimes XML data can be related to ontologies defining classes of objects, such classes can also be interpreted as types. Type systems proved to be extremely useful in programming languages, for instance to automatically discover certain kinds of errors. READ MORE