Sökning: "Recursion"

Visar resultat 11 - 15 av 48 avhandlingar innehållade ordet Recursion.

1. 11. Applications of Integer Quadratic Programming in Control and Communication

   Författare :Daniel Axehill; Anders Hansson; Anders Rantzer; Linköpings universitet; []
   Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Optimization; Model Predictive Control; CDMA; Quadratic Programming; Mixed Integer Quadratic Programming; Dual active set methods; Riccati recursion; Branch and bound; Automatic control; Reglerteknik;

   Sammanfattning : The main topic of this thesis is integer quadratic programming with applications to problems arising in the areas of automatic control and communication. One of the most widespread modern control principles is the discrete-time method Model Predictive Control (MPC). LÄS MER

3. 12. Metamathematical fixed points

   Författare :Rasmus Blanck; Göteborgs universitet; []
   Nyckelord :HUMANIORA; HUMANITIES; arithmetised metamathematics; fixed point; recursion theory;

   Sammanfattning : This thesis concerns the concept of metamathematical fixed points. After an introduction, we survey the field of metamathematics, from la fin du siècle to present. We are especially interested in the notion of fixed points, theorems on the existence of various kinds of fixed points, and their applications to metamathematics. LÄS MER

4. 13. Dependent Type Theory with Parameterized First-Order Data Types and Well-Founded Recursion

   Författare :David Wahlstedt; Chalmers tekniska högskola; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES;

   Sammanfattning : We present a variation of Martin-Löf's logical framework with "beta-iota-equality", extended with first-order parameterized algebraic data types and recursive pattern-matching definitions. Our contribution is a proof of normalization for the proposed system, from which we obtain decidable type-correctness. LÄS MER

5. 14. Primitive Direcursion and Difunctorial Semantics of Typed Object Calculus

   Författare :Johan Glimming; Karl Meinke; John Power; Stockholms universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; denotational semantics; axiomatic domain theory; coalgebra; primitive co recursion; object-based programming; typed object calculus; Computer science; Datavetenskap; datalogi; Computer Science;

   Sammanfattning : In the first part of this thesis, we contribute to the semantics of typed object calculus by giving (a) a category-theoretic denotational semantics using partial maps making use of an algebraic compactness assumption, (b) a notion of "wrappers'' by which algebraic datatypes can be represented as object types, and (c) proofs of computational soundness and adequacy of typed object calculus via Plotkin's FPC (with lazy operational semantics), thus making models of FPC suitable also for first-order typed object calculus (with recursive objects supporting method update, but not subtyping). It follows that a valid equation in the model induces operationally congruent terms in the language, so that program algebras can be studied. LÄS MER

7. 15. Performance enhancement in a well-structured pattern matcher through partial evaluation

   Författare :Pär Emanuelson; Linköpings universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Computer science; Datavetenskap;

   Sammanfattning : Partial evaluation is a technique which can be utilized for the generation of compiled code from the corresponding interpreter. In this work the partial evaluation technique is applied to a pattern match interpreter, in order to achieve the simultaneous goals of a general, well-structured program which is extendible and still make high performance at execution possible. LÄS MER