Skip to main content
SpringerLink
Log in

Theoretical Aspects of Computer Software

International Conference TACS ’91, Sendai, Japan, September 24–27, 1991. Proceedings

  • Conference proceedings
  • © 1991

Overview

Editors:
  1. Takayasu Ito
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Albert R. Meyer
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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

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

Access this book

Log in via an institution
Softcover Book USD 109.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

Licence this eBook for your library

Institutional subscriptions

Table of contents (37 papers)

  1. Front Matter

    Download chapter PDF

  2. A semantics for type checking

    • Gordon Plotkin
    Pages 1-17

  3. Type inference in polymorphic type discipline

    • Paola Giannini, Simona Ronchi, Della Rocca
    Pages 18-37

  4. Monotone recursive definition of predicates and its realizability interpretation

    • Makoto Tatsuta
    Pages 38-52

  5. Adding proof objects and inductive definition mechanisms to frege structures

    • Masahiko Sato
    Pages 53-87

  6. From term models to domains

    • Wesley Phoa
    Pages 88-111

  7. An abstract interpretation for ML equality kinds

    • Carl A. Gunter, Elsa L. Gunter, David B. MacQueen
    Pages 112-130

  8. Full abstraction and the Context Lemma (preliminary report)

    • Trevor Jim, Albert R. Meyer
    Pages 131-151

  9. An efficiency preorder for processes

    • S. Arun-Kumar, M. Hennessy
    Pages 152-175

  10. On nets, algebras and modularity

    • Alexander Rabinovich, Boris A. Trakhtenbrot
    Pages 176-203

  11. Towards a complete hierarchy of compositional dataflow models

    • Bengt Jonsson, Joost N. Kok
    Pages 204-225

  12. Type theory as a foundation for computer science

    • Robert L. Constable
    Pages 226-243

  13. What is in a step: On the semantics of statecharts

    • A. Pnueli, M. Shalev
    Pages 244-264

  14. Proving termination of general Prolog programs

    • Krzysztof R. Apt, Dino Pedreschi
    Pages 265-289

  15. On abstraction and the expressive power of programming languages

    • John C. Mitchell
    Pages 290-310

  16. Role of logic programming in the FGCS project

    • Kazuhiro Fuchi, Koichi Furukawa
    Pages 311-325

  17. Authentication and delegation with smart-cards

    • M. Abadi, M. Burrows, C. Kaufman, B. Lampson
    Pages 326-345

  18. Data flow analysis as model checking

    • Bernhard Steffen
    Pages 346-364

  19. On the adequacy of dependence-based representations for programs with heaps

    • Phil Pfeiffer, Rebecca Parsons Selke
    Pages 365-386

  20. From programming-by-example to proving-by-example

    • Masami Hagiya
    Pages 387-419
Back to top

Keywords

About this book

TACS'91 is the first International Conference on Theoretical Aspects of Computer Science held at Tohoku University, Japan, in September 1991. This volume contains 37 papers and an abstract for the talks presented at the conference. TACS'91 focused on theoretical foundations of programming, and theoretical aspects of the design, analysis and implementation of programming languages and systems. The following range of topics is covered: logic, proof, specification and semantics of programs and languages; theories and models of concurrent, parallel and distributed computation; constructive logic, category theory, and type theory in computer science; theory-based systems for specifying, synthesizing, transforming, testing, and verifying software.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation