Treffer 1 - 20 von 374 für Suche 'RAOULT J-C', Suchdauer: 0,76s Treffer weiter einschränken
  1. 1
    CAAP '92: 17th Colloquium on Trees in Algebra and Programming Rennes, France, February 26–28, 1992 Proceedings

    CAAP '92: 17th Colloquium on Trees in Algebra and Programming Rennes, France, February 26–28, 1992 Proceedings von Raoult, J. -C


    Volltext
    Buch

    Zu den Favoriten
    Gespeichert in:
  2. 2
    Varieties of increasing trees

    Varieties of increasing trees von Bergeron, François, Flajolet, Philippe, Salvy, Bruno


    Volltext
    Buchkapitel

    Zu den Favoriten
    Gespeichert in:
  3. 3
    Proving open properties by induction

    Proving open properties by induction von Raoult, Jean-Claude

    Veröffentlicht in Information processing letters

    Volltext
    Artikel

    Zu den Favoriten
    Gespeichert in:
  4. 4
    A linear algorithm for solving fixed-point equations on transition systems

    A linear algorithm for solving fixed-point equations on transition systems von Vergauwen, Bart, Lewi, Johan


    Volltext
    Tagungsbericht

    Zu den Favoriten
    Gespeichert in:
  5. 5
    A complete type inference algorithm for simple intersection types

    A complete type inference algorithm for simple intersection types von Coppo, M., Giannini, P.


    Volltext
    Tagungsbericht

    Zu den Favoriten
    Gespeichert in:
  6. 6
    Origin functions in λ-calculus and term rewriting systems

    Origin functions in λ-calculus and term rewriting systems von Bertot, Yves


    Volltext
    Tagungsbericht

    Zu den Favoriten
    Gespeichert in:
  7. 7
    Partial type assignment in left linear applicative term rewriting systems: Theory, applications and implementation

    Partial type assignment in left linear applicative term rewriting systems: Theory, applications and implementation von van Bakel, Steffen, Smetsers, Sjaak, Brock, Simon


    Volltext
    Tagungsbericht

    Zu den Favoriten
    Gespeichert in:
  8. 8
    Finite tree automata with cost functions

    Finite tree automata with cost functions von Seidl, Helmut


    Volltext
    Tagungsbericht

    Zu den Favoriten
    Gespeichert in:
  9. 9
    Modulo counting quantifiers over finite trees

    Modulo counting quantifiers over finite trees von Potthoff, Andreas


    Volltext
    Tagungsbericht

    Zu den Favoriten
    Gespeichert in:
  10. 10
    Monadic second-order definable graph transductions

    Monadic second-order definable graph transductions von Courcelle, Bruno


    Volltext
    Tagungsbericht

    Zu den Favoriten
    Gespeichert in:
  11. 11
    Context-Free Event Domains Are Recognizable

    Context-Free Event Domains Are Recognizable von Badouel, Eric, Darondeau, Philippe, Raoult, Jean-Claude

    Veröffentlicht in Information and computation

    Volltext
    Artikel

    Zu den Favoriten
    Gespeichert in:
  12. 12
    Graph grammars as context-dependent rewriting systems: A partial ordering semantics

    Graph grammars as context-dependent rewriting systems: A partial ordering semantics von Montanari, Ugo, Rossi, Francesca


    Volltext
    Tagungsbericht

    Zu den Favoriten
    Gespeichert in:
  13. 13
    Power domains supporting recursion and failure

    Power domains supporting recursion and failure von Heckmann, Reinhold


    Volltext
    Tagungsbericht

    Zu den Favoriten
    Gespeichert in:
  14. 14
    Decidability of reachability and disjoint union of term rewriting systems

    Decidability of reachability and disjoint union of term rewriting systems von Caron, Anne -Cécile


    Volltext
    Tagungsbericht

    Zu den Favoriten
    Gespeichert in:
  15. 15
    A constructive valuation interpretation for classical logic and its use in witness extraction

    A constructive valuation interpretation for classical logic and its use in witness extraction von Barbanera, Franco, Berardi, Stefano


    Volltext
    Tagungsbericht

    Zu den Favoriten
    Gespeichert in:
  16. 16
    An algebraic approach to the interpretation of recursive types

    An algebraic approach to the interpretation of recursive types von Cardone, Felice


    Volltext
    Tagungsbericht

    Zu den Favoriten
    Gespeichert in:
  17. 17
    Empty stack Pushdown ω-tree automata

    Empty stack Pushdown ω-tree automata von Peng, Wuxu, Purushothaman, S.


    Volltext
    Tagungsbericht

    Zu den Favoriten
    Gespeichert in:
  18. 18
    A programming language for deriving hypergraphs

    A programming language for deriving hypergraphs von Maggiolo-Schettini, Andrea, Winkowski, Józef


    Volltext
    Tagungsbericht

    Zu den Favoriten
    Gespeichert in:
  19. 19
    Beyond conditional equations: Quasi-initial semantics for parametric algebraic specifications

    Beyond conditional equations: Quasi-initial semantics for parametric algebraic specifications von Wolter, Uwe, Löwe, Michael


    Volltext
    Tagungsbericht

    Zu den Favoriten
    Gespeichert in:
  20. 20
    Parallel contraction of fibonacci trees and prefix computations on a family of interconnection topologies

    Parallel contraction of fibonacci trees and prefix computations on a family of interconnection topologies von Hsu, W. -J., Page, C. V., Liu, J.


    Volltext
    Tagungsbericht

    Zu den Favoriten
    Gespeichert in:

Suchwerkzeuge: