for an informal presentation at CIE 2007 [2] is a typed -calculus that pursues the reuse of the term constructions both at the level of types and at the level of contexts, while en...
A reflexive graph is a simple undirected graph where a loop has been added at each vertex. If G and H are reflexive graphs and U V (H), then a vertex map f : U V (G) is called n...
We formally define a notion of credit and responsibility within the Generalized Non Deducibility on Compositions framework. We investigate the validity of our definitions through ...
The Web poses novel and interesting problems for both programming language design and verification--and their intersection. This paper provides a personal outline of one thread of...
Latency insensitive protocols (LIPs) have been proposed as a viable means to connect synchronous IP blocks via long interconnects in a system-on-chip. The reason why one needs to ...
Syed Suhaib, Deepak Mathaikutty, Sandeep K. Shukla...