Proof Theoretic Concepts for the Semantics of Types and Concurrency

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.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Apr 01, 1995
Accession Number
ADA295650

Entities

People

  • Carl Gunter

Organizations

  • University of Pennsylvania

Tags

Communities of Interest

  • C4I

DTIC Thesaurus Topics

  • Algorithms
  • Artificial Intelligence
  • Computations
  • Computer Programming
  • Computer Programs
  • Computer Science
  • Computers
  • Construction
  • Information Science
  • Judgment
  • Language
  • Mathematics
  • Notation
  • Petri Nets
  • Programming Languages
  • Recursive Functions
  • Theoretical Computer Science

Readers

  • Database Systems and Applications
  • Graph Algorithms and Convex Optimization.
  • Organizational Psychology.