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 theoretical aspects of programming, programming languages and system, and parallel and distributed computation. The papers in the volume are grouped into sessions on: lambda calculus and programming; automated deduction; functional programming; objects and assignments; concurrency; term rewriting and process equivalence; type theory and programming; algebra, categories and linear logic; and subtyping, intersection and union types. The volume also includes seven invited talks and two open lectures.
Author(s): Samson Abramsky, Pasquale Malacaria (auth.), Masami Hagiya, John C. Mitchell (eds.)
Series: Lecture Notes in Computer Science 789
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 1994
Language: English
Pages: 892
Tags: Logics and Meanings of Programs; Programming Languages, Compilers, Interpreters; Software Engineering; Programming Techniques; Computation by Abstract Devices
Full Abstraction for PCF (extended abstract)....Pages 1-15
Fully abstract semantics for concurrent λ-calculus....Pages 16-35
An operational approach to combining classical set theory and functional programming languages....Pages 36-55
ML typing, explicit polymorphism and qualified types....Pages 56-75
Extensions to type systems can preserve operational equivalences....Pages 76-95
Constraint programming and database query languages....Pages 96-120
Intuitionistic resolution for a logic programming language with scoping constructs....Pages 121-140
Proof by pointing....Pages 141-160
A computer-checked verification of Milner's scheduler....Pages 161-178
A purely functional language with encapsulated assignment....Pages 179-202
Simple termination of hierarchical combinations of term rewriting systems....Pages 203-223
Separate abstract interpretation for control-flow analysis....Pages 224-243
Extensible denotational language specifications....Pages 244-272
A normalizing calculus with overloading and subtyping....Pages 273-295
A theory of primitive objects....Pages 296-320
Programming objects with ML-ART an extension to ML with abstract and record types....Pages 321-346
A type system for a lambda calculus with assignments....Pages 347-364
Theory and practice of Concurrent Object-Oriented Computing....Pages 365-365
The family relation in Interaction Systems....Pages 366-384
On syntactic and semantic action refinement....Pages 385-404
Locality and true-concurrency in calculi for mobile processes....Pages 405-424
Term rewriting properties of SOS axiomatisations....Pages 425-439
The tyft/tyxt format reduces to tree rules....Pages 440-453
Undecidable equivalences for basic parallel processes....Pages 454-464
Normal proofs and their grammar....Pages 465-493
A symmetric lambda calculus for “classical” program extraction....Pages 495-515
The λ Δ -calculus....Pages 516-542
Syntactic definitions of undefined: On defining the undefined....Pages 543-554
Discovering needed reductions using type theory....Pages 555-574
Nontraditional applications of automata theory....Pages 575-597
Abstract pre-orders....Pages 598-617
Categorical models of relational databases I: Fibrational formulation, schema integration....Pages 618-641
Petri nets, Horn programs, Linear Logic, and vector games....Pages 642-666
A complete type inference system for subtyped recursive types....Pages 667-686
Subtyping with union types, intersection types and recursive types....Pages 687-706
A decidable intersection type system based on relevance....Pages 707-725
Temporal verification diagrams....Pages 726-765
A semantic theory for Concurrent ML....Pages 766-785
Replication in concurrent combinators....Pages 786-805
Transitions as interrupts: A new semantics for timed statecharts....Pages 806-821
Relating multifunctions and predicate transformers through closure operators....Pages 822-843
Notes on typed object-oriented programming....Pages 844-885
Observing truly concurrent processes....Pages 886-886
