1,032 research outputs found
Kann man die Gebrauchstheorie der Bedeutung in der Semantik gebrauchen?
The following article deals with some aspects of special theories of meaning – namely those which consider the meaning of a linguistic sign as a function of its use. Although this approach to meaning is commonly attributed to Wittgenstein, I do not aim at an interpretation or exegesis of this philosopher but rather at a systematic discussion of meaning-as-use-theories. In the first section, I discuss the very notion of a theory of meaning. The next section provides a list of criteria which a theory of meaning should fulfill in order to be a meaning-as-use-theory. The formal architecture of semantic theories is discussed in the third section and – dealing with the simpler case of a referential theory of meaning as an example – the fourth section explains how semantic theories are given a theoretical underpinning by being interpreted within a theory of meaning. The same is done for the case of meaning-as-use-theories in the final section
Entwicklung eines Source-to-Source Compilers fĂĽr explizite Optimierung
Die Laufzeitoptimierung von Programmen involviert oft repetitive Transformationen des Source Codes, welche aufwendig sind und den Code schwerer verständlich machen. In dieser Arbeit wird ein Source to Source Compiler präsentiert, mit welchem derartige Transformationen automatisiert werden können. Dieser Compiler wurde für eine Teilmenge von OpenCL-C und C entwickelt und nutzt Pragmas, um anzugeben, wann welche Transformationen angewendet werden sollen. Die Transformationen können zudem noch parametrisiert sein. Durch selektives Anwenden der Transformationen und Durchprobieren mehrerer Parameterkombinationen können damit leicht viele unterschiedliche Versionen des Codes erstellt werden, die für Autotuning genutzt werden könnten. Bei Autotuning wird die Laufzeit der unterschiedlichen Versionen geschätzt und es kann die beste für die aktuelle Hardware ausgewählt werden
Translating Generalized Algebraic Data Types to System F
Generalized algebraic data types (GADTs) extend ordinary
algebraic data types by refining the types of constructors with syntactic
equality constraints. This is highly useful and allows for novel applications
such as strongly-typed evaluators, typed LR parsing etc. To translate
GADTs we need to enrich the System F style typed intermediate
languages of modern language implementations to capture these equality
constraints. We show that GADTs can be translated to a minor extension
of System F where type equality proofs are compiled into System
F typable proof terms. At run-time proof terms evaluate to the identity.
Hence, they can be safely erased before execution of the program. We
provide evidence that our approach scales to deal with extensions where
equality is not anymore syntactic. The benefit of our method is that type
checking of target programs remains as simple as type checking in System
F. Thus, we can offer a light-weight approach to integrate GADTs
and extensions of it into existing implementations
- …