close
1.

図書

図書
Anthony Ralston
出版情報: New York : McGraw-Hill, [1971]  xxiii, 513 p ; 23 cm
シリーズ名: McGraw-Hill computer science series
所蔵情報: loading…
2.

図書

図書
Kim B. Bruce
出版情報: Cambridge, Mass. ; London : MIT Press, c2002  xx, 384 p. ; 24 cm
所蔵情報: loading…
3.

図書

図書
Bryan Higman
出版情報: London : Macdonald, 1967  164 p ; 23 cm
シリーズ名: Macdonald computer monographs ; 2
所蔵情報: loading…
4.

図書

図書
Wilfried Brauer ... [et al.] (eds.)
出版情報: Berlin : Springer, c2002  xxxvi, 429 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 2300
所蔵情報: loading…
目次情報: 続きを見る
Bibliography of Grzegorz Rozenberg
Words, Languages, Automata / I:
Balanced Grammars and Their Languages / Jean Berstel ; Luc Boasson
Safety and Liveness Properties for Real Traces and a Direct Translation from LTL to Monoids / Volker Diekert ; Paul Gastin
The Delta Operation: From Strings to Trees to Strings / Joost Engelfriet
Infinite Solutions of Marked Post Correspondence Problem / Vesa Halava ; Tero Harju
The Branching Point Approach to ConwayÆs Problem / Juhani Karhumaki ; Ion Petre
A Survey of Some Quantitative Approaches to the Notion of Information / Aldo de Luca
Nondeterministic Trajectories / Alexandru Mateescu ; Arto Salomaa
Binary Patterns in Infinite Binary Words / Antonio Restivo ; Sergio Salemi
Graph Transformations / II:
A Sight-seeing Tour of the Computational Landscape of Graph Transformation / Hans-Jörg Kreowski
Local Action Systems and DPO Graph Transformation / DirkJanssens
Bisimulation Equivalences for Graph Grammars / Paolo Baldan ; Andrea Corradini ; Ugo Montanari
Petri Nets / III:
High-Level Net Processes / Hartmut Ehrig ; Kathrin Hoffmann ; Julia Padberg ; Reiko Heckel
Petri Net Control for Grammar Systems / Maurice ter Beek ; Jetty Kleijn
Regular Event Structures and Finite Petri Nets: A Conjecture / P.S. Thiagarajan
Concurrent Computing / IV:
Towards Team-Automata-Driven Object-Oriented Collaborative Work / Gregor Engels ; LuukGroenewegen
Grammars as Processes / Javier Esparza
Temporal Concurrent Constraint Programming: Applications and Behavior / Mogens Nielsen ; FrankD. Valencia
Molecular Computing / V:
Rewriting P Systems with Conditional Communication / Paolo Bottoni ; Anna Labella ; Carlos Martín-Vide ; Gheorghe Paun
An Aqueous Algorithm for Finding the Bijections Contained in a Binary Relation / Tom Head
Upper Bounds for Restricted Splicing / HendrikJan Hoogeboom ; Nikè van Vugt
Codes, Involutions, and DNA Encodings / Lila Kari ; Rob Kitto ; Gabriel Thierrin
DNA Manipulations in Ciliates / David M. Prescott
A Magic Pot Self-assembly Computation Revisited / Takashi Yokomori ; Yasubumi Sakakibara ; Satoshi Kobayashi
Author Index
Bibliography of Grzegorz Rozenberg
Words, Languages, Automata / I:
Balanced Grammars and Their Languages / Jean Berstel ; Luc Boasson
5.

図書

図書
David Sands (ed.)
出版情報: Berlin : Springer, c2001  xiii, 431 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 2028
所蔵情報: loading…
目次情報: 続きを見る
A Query Language Based on the Ambient Logic / Luca Cardelli ; Giorgio Ghelli
Probabilistic Polynomial-Time Process Calculus and Security Protocol Analysis / John C. Mitchell
A Systematic Approach to Static Access Control / François Pottier ; Christian Skalka ; Scott Smith
Secure Information Flow and CPS / Steve Zdancewic ; Andrew C. Myers
Enforcing Safety Properties Using Type Specialization / Peter Thiemann
Semantics and Program Analysis of Computationally Secure Information Flow / Peeter Laud
Encoding Intensional Type Analysis / Stephanie Weirich
Fusion on Languages / Roland Backhouse
Programming the Web with High-Level Programming Languages / Paul Graunke ; Shriram Krishnamurthi ; Steve Van Der Hoeven ; Matthias Felleisen
On the Completeness of Model Checking / Francesco Ranzato
Modal Transition Systems: A Foundation for Three-Valued Program Analysis / Michael Huth ; Radha Jagadeesan ; David Schmidt
Entailment with Conditional Equality Constraints / Zhendong Su ; Alexander Aiken
On the Complexity of Constant Propagation / Markus Müller-Olm ; Oliver Rüthing
What Are Polymorphically-Typed Ambients? / Torben Amtoft ; Assaf J. Kfoury ; Santiago M. Pericas-Geertsen
JOIN(X): Constraint-Based Type Inference for the Join-Calculus / Sylvain Conchon ; Francois Pottier
Modular Causality in a Synchronous Stream Language / Pascal Cuoq ; Marc Pouzet
Control-Flow Analysis in Cubic Time / Flemming Nielson ; Helmut Seidl
The Recursive Record Semantics of Objects Revisited / Gérard Boudol
A Formalisation of JavaÆs Exception Mechanism / Bart Jacobs
A Formal Executable Semantics of the JavaCard Platform / Gilles Barthe ; Guillaume Dufay ; Line Jakubiec ; Bernard Serpette ; Simão Melo de Sousa
Modeling an Algebraic Stepper / John Clements ; Matthew Flatt
Typestate Checking of Machine Code / Zhichen Xu ; Thomas Reps ; Barton P. Miller
Proof-Directed De-compilation of Low-Level Code / Shin-ya Katsumata ; Atsushi Ohori
Backwards Abstract Interpretation of Probabilistic Programs / David Monniaux
Tool Demonstration: Finding Duplicated Code Using Program Dependences / Raghavan Komondoor ; Susan Horwitz
Compiling Problem Specifications into SAT / Marco Cadoli ; Andrea Schaerf
Semantics and Termination of Simply-Moded Logic Programs with Dynamic Scheduling / Annalisa Bossi ; Sandro Etalle ; Sabina Rossi ; Jan-Georg Smaus
The Def-inite Approach to Dependency Analysis / Samir Genaim ; Michael Codish
Author Index
A Query Language Based on the Ambient Logic / Luca Cardelli ; Giorgio Ghelli
Probabilistic Polynomial-Time Process Calculus and Security Protocol Analysis / John C. Mitchell
A Systematic Approach to Static Access Control / François Pottier ; Christian Skalka ; Scott Smith
6.

図書

図書
Benjamin C. Pierce, editor
出版情報: Cambridge, Mass. : MIT Press, c2005  xiii, 574 p. ; 24 cm
所蔵情報: loading…
目次情報: 続きを見る
Preface
Precise Type Analyses / I:
Substructural Type Systems / David Walker1:
Dependent Types / David Aspinall ; Martin Hofmann2:
Types for Low-Level Languages / II:
Typed Assembly Language / Greg Morrisett4:
Proof-Carrying Code / George Necula5:
Types and Reasoning about Programs / III:
Logical Relations and a Case Study in Equivalence Checking / Karl Crary6:
Typed Operational Reasoning / Andrew Pitts7:
Types for Programming in the Large / IV:
Design Considerations for ML-Style Module Systems / Robert Harper ; Benjamin C. Pierce8:
Type Definitions / Christopher Stone9:
Type Inference / V:
The Essence of ML Type Inference / Francois Pottier ; Didier Remy10:
A Solutions to Selected Exercises
References
Index
Preface
Precise Type Analyses / I:
Substructural Type Systems / David Walker1:
7.

図書

図書
Mooly Sagiv (ed.)
出版情報: Berlin : Springer, c2005  xiii, 438 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 3444
所蔵情報: loading…
8.

図書

図書
Jouko Väänänen (ed.)
出版情報: Berlin ; Tokyo : Springer, c1999  139 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 1754
所蔵情報: loading…
目次情報: 続きを見る
Generalized Quantifiers, an Introduction / Jouko Väänänen
Counting and Locality over Finite Structures A Survey / Leonid Libkin ; Juha Nurmonen
A Perspective on Lindström Quantifiers and Oracles / Iain A. Stewart
Generalized Quantifiers in Logic Programs / Thomas Eiter ; Georg Gottlob ; Helmut Veith
A Generalized Quantifier Concept in Computational Complexity Theory / Heribert Vollmer
Ramsey Theory Is Needed for Solving Definability Problems of Generalized Quantifiers / Kerkko Luosto
Generalized Quantifiers, an Introduction / Jouko Väänänen
Counting and Locality over Finite Structures A Survey / Leonid Libkin ; Juha Nurmonen
A Perspective on Lindström Quantifiers and Oracles / Iain A. Stewart
9.

図書

図書
Peter Sestoft (ed.)
出版情報: Berlin : Springer, c2006  xii, 341 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 3924
所蔵情報: loading…
10.

図書

図書
David A. Watt ; with contributions by William Findlay
出版情報: Chichester : John Wiley & Sons, c2004  xviii, 473 p. ; 24 cm
所蔵情報: loading…
目次情報: 続きを見る
Preface
Introduction / Part I:
Programming languages / 1:
Programming linguistics / 1.1:
Concepts and paradigms / 1.1.1:
Syntax, semantics, and pragmatics / 1.1.2:
Language processors / 1.1.3:
Historical development / 1.2:
Summary
Further reading
Exercises
Basic Concepts / Part II:
Values and types / 2:
Types / 2.1:
Primitive types / 2.2:
Built-in primitive types / 2.2.1:
Defined primitive types / 2.2.2:
Discrete primitive types / 2.2.3:
Composite types / 2.3:
Cartesian products, structures, and records / 2.3.1:
Mappings, arrays, and functions / 2.3.2:
Disjoint unions, discriminated records, and objects / 2.3.3:
Recursive types / 2.4:
Lists / 2.4.1:
Strings / 2.4.2:
Recursive types in general / 2.4.3:
Type systems / 2.5:
Static vs dynamic typing / 2.5.1:
Type equivalence / 2.5.2:
The Type Completeness Principle / 2.5.3:
Expressions / 2.6:
Literals / 2.6.1:
Constructions / 2.6.2:
Function calls / 2.6.3:
Conditional expressions / 2.6.4:
Iterative expressions / 2.6.5:
Constant and variable accesses / 2.6.6:
Implementation notes / 2.7:
Representation of primitive types / 2.7.1:
Representation of Cartesian products / 2.7.2:
Representation of arrays / 2.7.3:
Representation of disjoint unions / 2.7.4:
Representation of recursive types / 2.7.5:
Variables and storage / 3:
Simple variables / 3.1:
Composite variables / 3.3:
Total vs selective update / 3.3.1:
Static vs dynamic vs flexible arrays / 3.3.2:
Copy semantics vs reference semantics / 3.4:
Lifetime / 3.5:
Global and local variables / 3.5.1:
Heap variables / 3.5.2:
Persistent variables / 3.5.3:
Pointers / 3.6:
Pointers and recursive types / 3.6.1:
Dangling pointers / 3.6.2:
Commands / 3.7:
Skips / 3.7.1:
Assignments / 3.7.2:
Proper procedure calls / 3.7.3:
Sequential commands / 3.7.4:
Collateral commands / 3.7.5:
Conditional commands / 3.7.6:
Iterative commands / 3.7.7:
Expressions with side effects / 3.8:
Command expressions / 3.8.1:
Expression-oriented languages / 3.8.2:
Storage for global and local variables / 3.9:
Storage for heap variables / 3.9.2:
Representation of dynamic and flexible arrays / 3.9.3:
Bindings and scope / 4:
Bindings and environments / 4.1:
Scope / 4.2:
Block structure / 4.2.1:
Scope and visibility / 4.2.2:
Static vs dynamic scoping / 4.2.3:
Declarations / 4.3:
Type declarations / 4.3.1:
Constant declarations / 4.3.2:
Variable declarations / 4.3.3:
Procedure definitions / 4.3.4:
Collateral declarations / 4.3.5:
Sequential declarations / 4.3.6:
Recursive declarations / 4.3.7:
Scopes of declarations / 4.3.8:
Blocks / 4.4:
Block commands / 4.4.1:
Block expressions / 4.4.2:
The Qualification Principle / 4.4.3:
Procedural abstraction / 5:
Function procedures and proper procedures / 5.1:
Function procedures / 5.1.1:
Proper procedures / 5.1.2:
The Abstraction Principle / 5.1.3:
Parameters and arguments / 5.2:
Copy parameter mechanisms / 5.2.1:
Reference parameter mechanisms / 5.2.2:
The Correspondence Principle / 5.2.3:
Implementation of procedure calls / 5.3:
Implementation of parameter mechanisms / 5.3.2:
Advanced Concepts / Part III:
Data abstraction / 6:
Program units, packages, and encapsulation / 6.1:
Packages / 6.1.1:
Encapsulation / 6.1.2:
Abstract types / 6.2:
Objects and classes / 6.3:
Classes / 6.3.1:
Subclasses and inheritance / 6.3.2:
Abstract classes / 6.3.3:
Single vs multiple inheritance / 6.3.4:
Interfaces / 6.3.5:
Representation of objects / 6.4:
Implementation of method calls / 6.4.2:
Generic abstraction / 7:
Generic units and instantiation / 7.1:
Generic packages in ADA / 7.1.1:
Generic classes in C++ / 7.1.2:
Type and class parameters / 7.2:
Type parameters in ADA / 7.2.1:
Type parameters in C++ / 7.2.2:
Class parameters in JAVA / 7.2.3:
Implementation of ADA generic units / 7.3:
Implementation of C++ generic units / 7.3.2:
Implementation of JAVA generic units / 7.3.3:
Inclusion polymorphism / 8:
Types and subtypes / 8.1.1:
Classes and subclasses / 8.1.2:
Parametric polymorphism / 8.2:
Polymorphic procedures / 8.2.1:
Parameterized types / 8.2.2:
Type inference / 8.2.3:
Overloading / 8.3:
Type conversions / 8.4:
Implementation of parametric polymorphism / 8.5:
Control flow / 9:
Sequencers / 9.1:
Jumps / 9.2:
Escapes / 9.3:
Exceptions / 9.4:
Implementation of jumps and escapes / 9.5:
Implementation of exceptions / 9.5.2:
Concurrency / 10:
Why concurrency? / 10.1:
Programs and processes / 10.2:
Problems with concurrency / 10.3:
Nondeterminism / 10.3.1:
Speed dependence / 10.3.2:
Deadlock / 10.3.3:
Starvation / 10.3.4:
Process interactions / 10.4:
Independent processes / 10.4.1:
Competing processes / 10.4.2:
Communicating processes / 10.4.3:
Concurrency primitives / 10.5:
Process creation and control / 10.5.1:
Interrupts / 10.5.2:
Spin locks and wait-free algorithms / 10.5.3:
Events / 10.5.4:
Semaphores / 10.5.5:
Messages / 10.5.6:
Remote procedure calls / 10.5.7:
Concurrent control abstractions / 10.6:
Conditional critical regions / 10.6.1:
Monitors / 10.6.2:
Rendezvous / 10.6.3:
Paradigms / Part IV:
Imperative programming / 11:
Key concepts / 11.1:
Pragmatics / 11.2:
A simple spellchecker / 11.2.1:
Case study: C / 11.3:
Variables, storage, and control / 11.3.1:
Independent compilation / 11.3.3:
Preprocessor directives / 11.3.6:
Function library / 11.3.7:
Case study: Ada / 11.3.8:
Separate compilation / 11.4.1:
Package library / 11.4.8:
Object-oriented programming / 11.4.9:
Case study: C++ / 12.1:
Independent compilation and preprocessor directives / 12.3.1:
Class and template library / 12.3.8:
Case study: Java / 12.3.9:
Separate compilation and dynamic linking / 12.4.1:
Class library / 12.4.8:
Case study: Ada95 / 12.4.9:
Concurrent programming / 12.5.1:
Process creation and termination / 13.1:
Mutual exclusion / 13.3.2:
Admission control / 13.3.3:
Scheduling away deadlock / 13.3.4:
Functional programming / 13.4:
Eager vs normal-order vs lazy evaluation / 14.1:
Case study: Haskell / 14.2:
Lazy evaluation / 14.3.1:
Modeling state / 14.3.5:
Logic programming / 14.3.8:
Case study: Prolog / 15.1:
Values, variables, and terms / 15.3.1:
Assertions and clauses / 15.3.2:
Relations / 15.3.3:
The closed-world assumption / 15.3.4:
Control / 15.3.5:
Input/output / 15.3.7:
Scripting / 15.3.8:
Regular expressions / 16.1:
Case study: Python / 16.3:
Module library / 16.3.1:
Conclusion / Part V:
Language selection / 17:
Criteria / 17.1:
Evaluation / 17.2:
Language design / 18:
Selection of concepts / 18.1:
Regularity / 18.2:
Simplicity / 18.3:
Efficiency / 18.4:
Syntax / 18.5:
Language life cycles / 18.6:
The future / 18.7:
Bibliography
Glossary
Index
Preface
Introduction / Part I:
Programming languages / 1:
文献の複写および貸借の依頼を行う
 文献複写・貸借依頼