Theoretical Aspects of Computer Software

1. From LP to LP: Programming with constraints

   • Jean-Louis Lassez

   Pages 420-446

2. Polynomial recursion analysis in pascal like programs

   • Dieter Armbruster

   Pages 447-458

3. Complexity of proving program correctness

   • Hardi Hungar

   Pages 459-474

4. Some normalization properties of martin-löf's type theory, and applications

   • David A. Basin, Douglas J. Howe

   Pages 475-494

5. Parametricity of extensionally collapsed term models of polymorphism and their categorical properties

   • Ryu Hasegawa

   Pages 495-512

6. Programs with continuations and linear logic

   • Shin-ya Nishizaki

   Pages 513-531

7. π-Calculus semantics of object-oriented programming languages

   • David Walker

   Pages 532-547

8. Wrapper semantics of an object-oriented programming language with state

   • Andreas V. Hense

   Pages 548-568

9. Sharing actions and attributes in modal action logic

   • Mark Ryan, José Fiadeiro, Tom Maibaum

   Pages 569-593

10. First order data types and first order logic

    • Ralf Treinen

    Pages 594-614

11. Efficient program synthesis: Semantics, logic, complexity

    • Max I. Kanovich

    Pages 615-632

12. Principal type-schemes of BCI-lambda-terms

    • Sachio Hirokawa

    Pages 633-650

13. Intersection and union types

    • Franco Barbanera, Mariangiola Dezani-Ciancaglini

    Pages 651-674

14. The coherence of languages with intersection types

    • John C. Reynolds

    Pages 675-700

15. Singleton, union and intersection types for program extraction

    • Susumu Hayashi

    Pages 701-730

16. Subtyping + extensionality: Confluence of βηtop reduction in F≤

    • Pierre-Louis Curien, Giorgio Ghelli

    Pages 731-749

17. An extension of system F with subtyping

    • Luca Cardelli, Simone Martini, John C. Mitchell, Andre Scedrov

    Pages 750-770

18. Will logicians be replaced by machines?

    • Dana S. Scott

    Pages 771-771

19. Back Matter

    PDF

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.

• Attribut
• Delegation
• Konstruktive Logik
• Programmiersysteme
• Programming Systems
• Software-Engineering
• Typentheorie
• complexity
• design
• logic
• polymorphism
• programming
• testing
• theory of computation
• wissenschaftliches Rechen

Policies and ethics