11 |
Ein nichtdeterministischer call-by-need Lambda-Kalkül mit erratic choice operationale Semantik, Programmtransformationen und AnwendungenKutzner, Arne Unknown Date (has links)
Univ., Diss., 2000--Frankfurt (Main)
|
12 |
Region based program specialization an operational approach to polymorphic offline partial evaluation for ML-like languages /Helsen, Simon. Unknown Date (has links) (PDF)
University, Diss., 2002--Freiburg (Breisgau).
|
13 |
A universal realizability model for sequential functional computationRohr, Alexander. Unknown Date (has links)
Techn. University, Diss., 2002--Darmstadt.
|
14 |
Categorical semantics and composition of tree transducers / Kategorielle Semantik und Komposition von BaumübersetzernJürgensen, Claus 28 December 2004 (has links) (PDF)
In this thesis we see two new approaches to compose tree transducers and more general to fuse functional programs. The first abroach is based on initial algebras. We prove a new variant of the acid rain theorem for mutually recursive functions where the build function is substituted by a concrete functor. Moreover, we give a symmetric form (i.e. consumer and producer have the same syntactic form) of our new acid rain theorem where fusion is composition in a category and thus in particular associative. Applying this to compose top-down tree transducers yields the same result (on a syntactic level) as the classical top-down tree transducer composition. The second approach is based on free monads and monad transformers. In the same way as monoids are used in the theory of character string automata, we use monads in the theory of tree transducers. We generalize the notion of a tree transducer defining the monadic transducer, and we prove an according fusion theorem. Moreover, we prove that homomorphic monadic transducers are semantically equivalent. The latter makes it possible to compose syntactic classes of tree transducers (or particular functional programs) by simply composing endofunctors.
|
15 |
Categorical semantics and composition of tree transducersJürgensen, Claus 30 January 2004 (has links)
In this thesis we see two new approaches to compose tree transducers and more general to fuse functional programs. The first abroach is based on initial algebras. We prove a new variant of the acid rain theorem for mutually recursive functions where the build function is substituted by a concrete functor. Moreover, we give a symmetric form (i.e. consumer and producer have the same syntactic form) of our new acid rain theorem where fusion is composition in a category and thus in particular associative. Applying this to compose top-down tree transducers yields the same result (on a syntactic level) as the classical top-down tree transducer composition. The second approach is based on free monads and monad transformers. In the same way as monoids are used in the theory of character string automata, we use monads in the theory of tree transducers. We generalize the notion of a tree transducer defining the monadic transducer, and we prove an according fusion theorem. Moreover, we prove that homomorphic monadic transducers are semantically equivalent. The latter makes it possible to compose syntactic classes of tree transducers (or particular functional programs) by simply composing endofunctors.
|
Page generated in 0.1178 seconds