Sold Out
Book Categories |
Full Abstraction for PCF | 1 | |
Fully Abstract Semantics for Concurrent [lambda]-calculus | 16 | |
An Operational Approach to Combining Classical Set Theory and Functional Programming Languages | 36 | |
ML Typing, Explicit Polymorphism and Qualified Types | 56 | |
Extensions to Type Systems Can Preserve Operational Equivalences | 76 | |
Constraint Programming and Database Query Languages | 96 | |
Intuitionistic Resolution for a Logic Programming Language with Scoping Constructs | 121 | |
Proof by Pointing | 141 | |
A Computer-Checked Verification of Milner's Scheduler | 161 | |
A Purely Functional Language with Encapsulated Assignment | 179 | |
Simple Termination of Hierarchical Combinations of Term Rewriting Systems | 203 | |
Separate Abstract Interpretation for Control-Flow Analysis | 224 | |
Extensible Denotational Language Specifications | 244 | |
A Normalizing Calculus with Overloading and Subtyping | 273 | |
A Theory of Primitive Objects - Untyped and First-Order Systems | 296 | |
Programming Objects with ML-ART, an Extension to ML with Abstract and Record | 321 | |
A Type System for a Lambda Calculus with Assignments | 347 | |
Theory and Practice of Concurrent Object-Oriented Computing | 365 | |
The Family Relation in Interaction Systems | 366 | |
On Syntactic and Semantic Action Refinement | 385 | |
Locality and True-concurrency in Calculi for Mobile Processes | 405 | |
Term Rewriting Properties of SOS Axiomatisations | 425 | |
The Tyft/Tyxt Format Reduces to Tree Rules | 440 | |
Undecidable Equivalences for Basic Parallel Processes | 454 | |
Normal Proofs and their Grammar | 465 | |
A Symmetric Lambda Calculus for "Classical" Program Extraction | 495 | |
The [lambda][subscript[Delta]]-Calculus | 516 | |
Syntactic Definitions of Undefined: On Defining the Undefined | 543 | |
Discovering Needed Reductions Using Type Theory | 555 | |
Nontraditional Applications of Automata Theory | 575 | |
Abstract Pre-Orders | 598 | |
Categorical Models of Relational Databases I: Fibrational Formulation, Schema Integration | 618 | |
Petri Nets, Horn Programs, Linear Logic, and Vector Games | 642 | |
A Complete Type Inference System for Subtyped Recursive Types | 667 | |
Subtyping with Union Types, Intersection Types and Recursive Types | 687 | |
A Decidable Intersection Type System based on Relevance | 707 | |
Temporal Verification Diagrams | 726 | |
A Semantic Theory for Concurrent ML | 766 | |
Replication in Concurrent Combinators | 786 | |
Transitions as Interrupts: A New Semantics for Timed Statecharts | 806 | |
Relating Multifunctions and Predicate Transformers through Closure Operators | 822 | |
Notes on Typed Object-Oriented Programming | 844 | |
Observing Truly Concurrent Processes | 886 | |
Author Index | 887 |
Login|Complaints|Blog|Games|Digital Media|Souls|Obituary|Contact Us|FAQ
CAN'T FIND WHAT YOU'RE LOOKING FOR? CLICK HERE!!! X
You must be logged in to add to WishlistX
This item is in your Wish ListX
This item is in your CollectionTheoretical Aspects of Computer Software: Proceedings
X
This Item is in Your InventoryTheoretical Aspects of Computer Software: Proceedings
X
You must be logged in to review the productsX
X
X
Add Theoretical Aspects of Computer Software: Proceedings, This volume contains the proceedings of the Second International Symposium on Theoretical Aspects of Computer Science, held at Tohoku University, Japan in April 1994. This top-level international symposium on theoretical computer science is devoted to the, Theoretical Aspects of Computer Software: Proceedings to the inventory that you are selling on WonderClubX
X
Add Theoretical Aspects of Computer Software: Proceedings, This volume contains the proceedings of the Second International Symposium on Theoretical Aspects of Computer Science, held at Tohoku University, Japan in April 1994. This top-level international symposium on theoretical computer science is devoted to the, Theoretical Aspects of Computer Software: Proceedings to your collection on WonderClub |