Searching for authors named "Kevin Watkins" – sorted by Relevance.
10 documents found, showing 1 through 10.
-
Abstract Specifying Properties of Concurrent Computations in CLF ∗
- …Abstract Specifying Properties of Concurrent Computations in CLF ∗ Kevin Watkins Carnegie Mellon…
- Add To MetaCart
-
On Regions and Linear Types
- …On Regions and Linear Types (Preliminary Notes) David Walker and Kevin Watkins Carnegie Mellon…
- Cited by 26 (2 self) – Add To MetaCart
-
On Regions and Linear Types (Extended Abstract)
- …On Regions and Linear Types (Extended Abstract) David Walker and Kevin Watkins Carnegie Mellon…
- Cited by 2 (0 self) – Add To MetaCart
-
A Concurrent Logical Framework II: Examples and Applications
- … Walker Kevin Watkins March 2002, revised May 2003 CMU-CS-02-102 School of Computer Science Carnegie…
- Cited by 23 (17 self) – Add To MetaCart
-
A concurrent logical framework I: Judgments and properties
- …A concurrent logical framework I: Judgments and properties Kevin Watkins Iliano Cervesato Frank…
- Cited by 40 (16 self) – Add To MetaCart
-
A Concurrent Logical Framework: The Propositional Fragment
- …A Concurrent Logical Framework: The Propositional Fragment # Kevin Watkins 1 , Iliano Cervesato…
- Cited by 22 (2 self) – Add To MetaCart
-
Monadic Concurrent Linear Logic Programming
- … ∗ j-polakow@(email omitted); Kevin Watkins Carnegie Mellon University kw@(email omitted); 1. INTRODUCTION…
- Cited by 22 (12 self) – Add To MetaCart
-
Fault-Tolerant Multicast Routing in the Mesh with No Virtual Channels
- …Fault-Tolerant Multicast Routing in the Mesh with No Virtual Channels Ran Libeskind-Hadas, Kevin…
- Add To MetaCart
-
-819 Typed Compilation Spring 2000 Karl Crary
- …15-819 Typed Compilation Spring 2000 Karl Crary Lecture 1 February 2, 2000 Scribe: Kevin Watkins 1…
- Add To MetaCart
-
Efficient implementation of a linear logic programming language
- …E#cient Implementation of a Linear Logic Programming Language Joshua S. Hodas and Kevin M. Watkins…
- Cited by 14 (9 self) – Add To MetaCart
Showing 1 through 10.
