Bücher	Elektronik, Foto
Musik-CDs	DVDs, Blu-ray
Spielzeug	Software

Freizeit, Sport	Haus und Garten
Computerspiele	Küchengeräte
Essen und Trinken	Drogerie und Bad

Inhaltsangaben
Kurzbeschreibungen
Zusammenfassungen

Buch, Hörbücher:

Programmiersprachen und Interpreter

Seite 8

AutoCAD Express

Tim McCarthy

Taschenbuch

Programmiermethodik mit Ada (Springer Compass)

Gerhard Goos, Guido Persch, Jürgen Uhl

Gebundene Ausgabe

Rewriting Techniques and Applications: Bordeaux, France, May 25-27, 1987. Proceedings (Lecture Notes in Computer Science (256), Band 256)

Pierre Lescanne

Taschenbuch

Combinators and Functional Programming Languages: Thirteenth Spring School of the LITP, Val d'Ajol, France, May 6-10, 1985. Proceedings (Lecture Notes in Computer Science (242), Band 242)

Guy Cousineau, Pierre-Louis Curien, Bernard Robinet

Taschenbuch

Streams are not dreams. - Amber. - The amber machine. - Sur l'analogie entre les propositions et les types. - Combinateurs Cat riques et Impl ntation des Langages Fonctionnels. - Combinators and lambda-calculus, a short outline. - Cartesian closed categories and lambda-calculus. - Cartesian closed categories and typed ? -calculi. - An introduction to fully-lazy supercombinators.

Automata, Languages and Programming: 13th International Colloquium, Rennes, France, July 15-19, 1986. Proceedings (Lecture Notes in Computer Science (226), Band 226)

Taschenbuch

Characterizations of P U N C and precomputation. - Comparison of algorithms controlling concurrent access to a database: A combinatorial approach. - A new duality result concerning Voronoi diagrams. - Classification of all the minimal bilinear algorithms for computing the coefficients of the product of two polynomials modulo a polynomial. - On exponential lowness. - A tradeoff between search and update time for the implicit dictionary problem. - Intersections of some families of languages. - Correspondence between ternary simulation and binary race analysis in gate networks. - Counting with rational functions. - Finite biprefix sets of paths in a Graph. - Parallel R A Ms with owned global memory and deterministic context-free language recognition. - A Strong restriction of the inductive completion procedure. - On discerning words by automata. - Complexity classes without machines: On complete languages for U P. - Containment, separation, complete sets, and immunity of complexity classes. - On nontermination of Knuth-Bendix algorithm. - Tradeoffs for language recognition on parallel computing models. - Rational equivalence relations. - Some further results on digital search trees. - Knowledge, belief and time. - A termination detector for static and dynamic distributed systems with asynchronous non-first-in-first-out communication. - Decompositions of nondeterministic reductions. - Hierarchical planarity testing algorithms. - Synthesis and equivalence of concurrent systems. - The set union problem with backtracking. - Torsion matrix semigroups and recognizable transductions. - On recognizable subsets of free partially commutative monoids. - Min Cut is N P-complete for edge weighted trees. - Alternating automata, the weak monadic theory of the tree, and its complexity. - Subpolynomial complexity classes of real functions and real numbers. - Etude syntaxique des parties reconnaissables de mots infinis. - Refusal testing. - A timed model for communicating sequential processes. - A uniform reduction. . .

Programs as Data Objects: Proceedings of a Workshop, Copenhagen, Denmark, October 17 - 19, 1985 (Lecture Notes in Computer Science (217), Band 217)

Harald Ganzinger, Neil D. Jones

Taschenbuch

Strictness analysis and polymorphic invariance. - Convergent term rewriting systems can be used for program transformation. - The theory of strictness analysis for higher order functions. - Recognition of generative languages. - Modular first-order specifications of operational semantics. - Logic specification of code generation techniques. - Strictness detection in non-flat domains. - Strictness computation using special ? -expressions. - A relational framework for abstract interpretation. - Expected forms of data flow analyses. - Code generation from two-level denotational meta-languages. - Multilevel functions in Martin-L f's type theory. - An implementation from a direct semantics definition. - The structure of a self-applicable partial evaluator. - Program transformation by supercompilation. - Listlessness is better than laziness I I: Composing listless functions. - From interpreter to compiler: A representational derivation.

Programming Languages for Industrial Robots (Symbolic Computation)

Christian Blume, Wilfried Jakob

Gebundene Ausgabe

Rewriting Techniques and Applications: Dijon, France, May 20-22, 1985 (Lecture Notes in Computer Science (202), Band 202)

Jean-Pierre Jouannaud

Taschenbuch

Semantik von Programmiersprachen (Studienreihe Informatik)

Elfriede Fehr

Taschenbuch

Language Design and Programming Methodology: Proceedings of a Symposium, Held in Sidney, Australia, September 10-11, 1979 (Lecture Notes in Computer Science (79), Band 79)

J. M. Tobias

Taschenbuch

The module: A system structuring facility in high-level programming languages. - The evolution of the unix time-sharing system. - Pascal versus C : A subjective comparison. - Why recursion? . - On the prime example of programming. - Describing the complete effects of programs. - Pattern-matching commands. - A language for describing concepts as programs. - A human movement language for computer animation. - Algebraic specifications and transition graphs. - Dasim1: A practical exercise in data abstraction. - The design of a successor to pascal. - Dopls: A new type of programming language. - A personal computer based on a high-level language. - An experiment in software science. - A critique of modula. - A comparison of two notations for process communication.

Buch, Hörbücher: Programmiersprachen und Interpreter
Weitere Seiten: