Vidal Naquet Guy (10 results)

paperback. Condition: Acceptable. ex-library hardcover with usual stamps and markings This is a damaged book. May be ex-library, water-damaged, or spine creased/broken. Acceptable, Reading copy only, with writing/markings and heavy wear. Standard-sized.

soft cover. Condition: fine. IN-8 broché, 128 pages. Sommaire : Jacques Chessex: Trace de l'été, Pages 1-16 --- Jean Rousselot: Rue de la Souche, Pages 17-21 --- Guy Rohou: L'oeil à facettes, Pages 22-36 --- Daniel Depland: Le chien de pique, Pages 37-45 --- Patrice Dyerval Angelini: Après Os de seiche (Ossi di seppia) (1925), Les Occasions (Le Occasioni) (1939) et., Pages 46-46 --- Eugenio Montale: Dix poèmes nouveaux, Pages 46-55 --- Pierre Vidal-Naquet: Les pèlerins de l'Iliade, Pages 56-62 --- Robert Levesque: Hors du temps, Pages 63-69 --- Antoine Terrasse: Marie-Hélène Vieira da Silva, Pages 70-73 --- Lionel Ray: Anthologie de la poésie danoise contemporaine (Gallimard), Pages 74-76 --- Jean-Charles Gateau: En compagnie d'Antonin Artaud et Poèmes, par Jacques Prevel (Flammarion), Pages 76-77 --- Pierre Jean Founau: Antonin Artaud : Correspondance et récupération de soi, Pages 78-84 --- Jean Duvignaud: W, par Georges Perec (Denoël), Pages 84-85 --- Hervé Cronel: L'écriture de l'histoire, par Michel de Certeau (Gallimard), Pages 86-89 --- Jean Blot: Surveiller et punir, par Michel Foucault (Gallimard), Pages 89-92 --- Jean-Michel Maulpoix: Vers la liberté en amour, par Charles Fourier (Gallimard), Pages 92-93 --- Jean Blot: Représentation et présence, par Georges Duthuit (Flammarion), Pages 93-95 --- Alain Bosquet: La saison des proses (Jean Dutourd, Camille Bourniquel, Jeanne Champion, Jean Joubert, Viviane Forrester), Pages 96-100 --- Jean Blot: Villa triste, par Patrick Modiano (Gallimard), Pages 100-102 --- Pier Paolo Pasolini: À propos de Femmes Femmes, Pages 103-105 --- Jean-Charles Gateau, Jean-Marie Straub: Rencontre, Pages 106-110 --- Michel Grisolia: La Chevauchée sauvage, de Richard Brooks, Pages 110-112 --- Antoine Terrasse: Jacques Villon, Pages 113-115.…

Condition: New.

Condition: New. In English.

Condition: As New. Unread book in perfect condition.

Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - Towards a theory of relativizations: Positive relativizations.- Natural semantics.- On local routing of two-terminal nets.- Geometric relations among Voronoi diagrams.- Finding the largest empty rectangle on a grated surface.- Efficient graph algorithms using limited communication on a fixed-size array of processors.- On selecting the largest element in spite of erroneous information.- The correlation between the complexities of the non-hierarchical and hierarchical versions of graph problems.- Graph isomorphism is in the low hierarchy.- A hierarchy theorem for almost everywhere complex sets with application to polynomial complexity degrees.- Self-reducibility.- Probability one separation of the Boolean hierarchy.- Reversal complexity of multicounter and multihead machines.- Computing the counting function of context-free languages.- On the k-freeness of morphisms on free monoids.- Avoidable patterns on 2 letters.- Polynomial operations on rational languages.- Some structural aspects of hypergraph languages generated by hyperedge replacement.- Specification and implementation of concurrently accessed data structures: An abstract data type approach.- On implementations of loose abstract data type specifications and their vertical composition.- Are homomorphisms sufficient for behavioural implementations of deterministic and nondeterministic data types .- Some remarks on presentations by finite Church-Rosser Thue systems.- Ground term confluence in parametric conditional equational specifications.- Describing semantic domains with sprouts.- Comparing direct and continuation semantics styles for concurrent languages.- Expressibility of first order logic with a nondeterministic inductive operator.- Bounded nondeterminism and the approximation induction principle in processalgebra.- The step failure semantics.- On the complexity of containment, equivalence, and reachability for finite and 2-dimensional vector addition systems with states.- Closure properties of deterministic Petri nets.- Some results on fairness: The regular case.- Decidability questions for fairness in Petri nets.- Optimal sorting on multi-dimensionally mesh-connected computers.- On the contact-minimization-problem.- Making distributed spanning tree algorithms fault-resilient.- The derivation of on-the-fly garbage collection algorithms from distributed termination detection protocols.- On the expected complexity of distributed selection.- LPG: A generic, logic and functional programming language.- CEC.- ASSPEGIQUE.- REVEUR4 : A laboratory for conditional rewriting.- An interactive, incremental and portable computer algebra system for -calculus and combinatory logic based on video edition and rewriting techniques.- The Passau RAP System: Rapid prototyping for algebraic specifications.- SPRAC: A software engineering environment.- SLOG: A logic interpreter for equational clauses.- An algebraic transformation system for occam programs.- REVE a rewrite rule laboratory.…

Paperback. Condition: Very Good. Dust Jacket may NOT BE INCLUDED.CDs may be missing. SHIPS FROM MULTIPLE LOCATIONS. book.

Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Towards a theory of relativizations: Positive relativizations.- Natural semantics.- On local routing of two-terminal nets.- Geometric relations among Voronoi diagrams.- Finding the largest empty rectangle on a grated surface.- Efficient graph algorithms using limited communication on a fixed-size array of processors.- On selecting the largest element in spite of erroneous information.- The correlation between the complexities of the non-hierarchical and hierarchical versions of graph problems.- Graph isomorphism is in the low hierarchy.- A hierarchy theorem for almost everywhere complex sets with application to polynomial complexity degrees.- Self-reducibility.- Probability one separation of the Boolean hierarchy.- Reversal complexity of multicounter and multihead machines.- Computing the counting function of context-free languages.- On the k-freeness of morphisms on free monoids.- Avoidable patterns on 2 letters.- Polynomial operations on rational languages.- Some structural aspects of hypergraph languages generated by hyperedge replacement.- Specification and implementation of concurrently accessed data structures: An abstract data type approach.- On implementations of loose abstract data type specifications and their vertical composition.- Are homomorphisms sufficient for behavioural implementations of deterministic and nondeterministic data types .- Some remarks on presentations by finite Church-Rosser Thue systems.- Ground term confluence in parametric conditional equational specifications.- Describing semantic domains with sprouts.- Comparing direct and continuation semantics styles for concurrent languages.- Expressibility of first order logic with a nondeterministic inductive operator.- Bounded nondeterminism and the approximation induction principle in process algebra.- The step failure semantics.- On the complexity of containment, equivalence, and reachability for finite and 2-dimensional vector addition systems with states.- Closure properties of deterministic Petri nets.- Some results on fairness: The regular case.- Decidability questions for fairness in Petri nets.- Optimal sorting on multi-dimensionally mesh-connected computers.- On the contact-minimization-problem.- Making distributed spanning tree algorithms fault-resilient.- The derivation of on-the-fly garbage collection algorithms from distributed termination detection protocols.- On the expected complexity of distributed selection.- LPG: A generic, logic and functional programming language.- CEC.- ASSPEGIQUE.- REVEUR4 : A laboratory for conditional rewriting.- An interactive, incremental and portable computer algebra system for -calculus and combinatory logic based on video edition and rewriting techniques.- The Passau RAP System: Rapid prototyping for algebraic specifications.- SPRAC: A software engineering environment.- SLOG: A logic interpreter for equational clauses.- An algebraic transformation system for occam programs.- REVE a rewrite rule laboratory. 500 pp. Englisch.…

Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Towards a theory of relativizations: Positive relativizations.- Natural semantics.- On local routing of two-terminal nets.- Geometric relations among Voronoi diagrams.- Finding the largest empty rectangle on a grated surface.- Efficient graph algorithms usi.…

Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Towards a theory of relativizations: Positive relativizations.- Natural semantics.- On local routing of two-terminal nets.- Geometric relations among Voronoi diagrams.- Finding the largest empty rectangle on a grated surface.- Efficient graph algorithms using limited communication on a fixed-size array of processors.- On selecting the largest element in spite of erroneous information.- The correlation between the complexities of the non-hierarchical and hierarchical versions of graph problems.- Graph isomorphism is in the low hierarchy.- A hierarchy theorem for almost everywhere complex sets with application to polynomial complexity degrees.- Self-reducibility.- Probability one separation of the Boolean hierarchy.- Reversal complexity of multicounter and multihead machines.- Computing the counting function of context-free languages.- On the k-freeness of morphisms on free monoids.- Avoidable patterns on 2 letters.- Polynomial operations on rational languages.- Some structural aspects of hypergraph languages generated by hyperedge replacement.- Specification and implementation of concurrently accessed data structures: An abstract data type approach.- On implementations of loose abstract data type specifications and their vertical composition.- Are homomorphisms sufficient for behavioural implementations of deterministic and nondeterministic data types .- Some remarks on presentations by finite Church-Rosser Thue systems.- Ground term confluence in parametric conditional equational specifications.- Describing semantic domains with sprouts.- Comparing direct and continuation semantics styles for concurrent languages.- Expressibility of first order logic with a nondeterministic inductive operator.- Bounded nondeterminism and the approximation induction principle in processalgebra.- The step failure semantics.- On the complexity of containment, equivalence, and reachability for finite and 2-dimensional vector addition systems with states.- Closure properties of deterministic Petri nets.- Some results on fairness: The regular case.- Decidability questions for fairness in Petri nets.- Optimal sorting on multi-dimensionally mesh-connected computers.- On the contact-minimization-problem.- Making distributed spanning tree algorithms fault-resilient.- The derivation of on-the-fly garbage collection algorithms from distributed termination detection protocols.- On the expected complexity of distributed selection.- LPG: A generic, logic and functional programming language.- CEC.- ASSPEGIQUE.- REVEUR4 : A laboratory for conditional rewriting.- An interactive, incremental and portable computer algebra system for -calculus and combinatory logic based on video edition and rewriting techniques.- The Passau RAP System: Rapid prototyping for algebraic specifications.- SPRAC: A software engineering environment.- SLOG: A logic interpreter for equational clauses.- An algebraic transformation system for occam programs.- REVE a rewrite rule laboratory.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 500 pp. Englisch.…