Theoretical Aspects of Computer Software

Overview

Editors:

• Masami Hagiya,
• John C. Mitchell

1. Masami Hagiya
   View editor publications

   You can also search for this editor in PubMed Google Scholar

2. John C. Mitchell
   View editor publications

   You can also search for this editor in PubMed Google Scholar

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.

• Automat
• Concurrency
• Formal Logics
• Formale Logik
• Programmiertheorie
• Programming Theory
• Termrewriting
• Type Theory
• Typentheorie
• automated deduction
• functional programming
• lambda calculus
• programming
• programming language

Search within this book

Search

1. Front Matter

   Download chapter PDF

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. An operational approach to combining classical set theory and functional programming languages

   • Douglas J. Howe, Scott D. Stoller

   Pages 36-55

5. ML typing, explicit polymorphism and qualified types

   • Mark P. Jones

   Pages 56-75

6. Extensions to type systems can preserve operational equivalences

   • Jon G. Riecke, Ramesh Subrahmanyam

   Pages 76-95

7. Constraint programming and database query languages

   • Paris C. Kanellakis, Dina Q. Goldin

   Pages 96-120

8. Intuitionistic resolution for a logic programming language with scoping constructs

   • Alain Hui Bon Hoa

   Pages 121-140

9. Proof by pointing

   • Yves Bertot, Gilles Kahn, Laurent Théry

   Pages 141-160

10. A computer-checked verification of Milner's scheduler

    • Henri Korver, Jan Springintveld

    Pages 161-178

11. A purely functional language with encapsulated assignment

    • Masahiko Sato

    Pages 179-202

12. Simple termination of hierarchical combinations of term rewriting systems

    • M. R. K. Krishna Rao

    Pages 203-223

13. Separate abstract interpretation for control-flow analysis

    • Yan Mei Tang, Pierre Jouvelot

    Pages 224-243

14. Extensible denotational language specifications

    • Robert Cartwright, Matthias Felleisen

    Pages 244-272

15. A normalizing calculus with overloading and subtyping

    • Hideki Tsuiki

    Pages 273-295

16. A theory of primitive objects

    • Martín Abadi, Luca Cardelli

    Pages 296-320

17. Programming objects with ML-ART an extension to ML with abstract and record types

    • Didier Rémy

    Pages 321-346

18. A type system for a lambda calculus with assignments

    • Kung Chen, Martin Odersky

    Pages 347-364

19. Theory and practice of Concurrent Object-Oriented Computing

    • Akinori Yonezawa

    Pages 365-365

20. The family relation in Interaction Systems

    • Andrea Asperti, Cosimo Laneve

    Pages 366-384

Back to top

Policies and ethics