Skip to main content
  • Conference proceedings
  • © 1994

Theoretical Aspects of Computer Software

International Symposium TACS ’94 Sendai, Japan, April 19–22, 1994 Proceedings

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 789)

Buy it now

Buying options

Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

This is a preview of subscription content, log in via an institution to check for access.

Table of contents (43 papers)

  1. Front Matter

  2. Full Abstraction for PCF (extended abstract)

    • Samson Abramsky, Pasquale Malacaria, Radha Jagadeesan
    Pages 1-15
  3. Fully abstract semantics for concurrent λ-calculus

    • Mariangiola Dezani-Ciancaglini, Ugo de'Liguoro, Adolfo Piperno
    Pages 16-35
  4. Extensions to type systems can preserve operational equivalences

    • Jon G. Riecke, Ramesh Subrahmanyam
    Pages 76-95
  5. Constraint programming and database query languages

    • Paris C. Kanellakis, Dina Q. Goldin
    Pages 96-120
  6. Proof by pointing

    • Yves Bertot, Gilles Kahn, Laurent Théry
    Pages 141-160
  7. A computer-checked verification of Milner's scheduler

    • Henri Korver, Jan Springintveld
    Pages 161-178
  8. Separate abstract interpretation for control-flow analysis

    • Yan Mei Tang, Pierre Jouvelot
    Pages 224-243
  9. Extensible denotational language specifications

    • Robert Cartwright, Matthias Felleisen
    Pages 244-272
  10. A theory of primitive objects

    • Martín Abadi, Luca Cardelli
    Pages 296-320
  11. A type system for a lambda calculus with assignments

    • Kung Chen, Martin Odersky
    Pages 347-364
  12. The family relation in Interaction Systems

    • Andrea Asperti, Cosimo Laneve
    Pages 366-384

About this book

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.

Bibliographic Information

Buy it now

Buying options

Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access