Accession Number:

ADA295650

Title:

Proof Theoretic Concepts for the Semantics of Types and Concurrency

Descriptive Note:

Final technical rept.

Corporate Author:

PENNSYLVANIA UNIV PHILADELPHIA DEPT OFCOMPUTER AND INFORMATION SCIENCE

Personal Author(s):

• Gunter, Carl

Report Date:

1995-04-01

Pagination or Media Count:

145.0

Abstract:

This is a collection of five papers that concern applications of ideas from proof theory to problems in the semantics of types and concurrency. They are Inheritance as implicit coercions, Computing with coercions, Nets as tensor theories preliminary report, Normal process representatives and Reference counting as a computational interpretation of linear logic.

Descriptors:

• *PROGRAMMING LANGUAGES
• *SEMANTICS
• *CONCURRENT ENGINEERING
• ALGORITHMS
• NEURAL NETS
• REASONING
• COMPUTER LOGIC
• COMPUTER PROGRAMMING
• MATHEMATICAL LOGIC
• COUNTING METHODS
• CONTROL THEORY
• COMPUTER PROGRAM VERIFICATION
• TRANSLATORS
• FIELDS(COMPUTER PROGRAMS)

Subject Categories:

• Computer Programming and Software
• Cybernetics

Distribution Statement:

APPROVED FOR PUBLIC RELEASE