Results 1 -
2 of
2
Effective Applicative Structures
- In: Proceedings of the 6th biennial conference on Category Theory in Computer Science (CTCS'95). Springer-Verlag Lecture Notes in Computer Science 953 81--95
, 1995
"... S. All local authors can be reached viae-mail at theaddress last-name@cs.unibo.it. Written requests and comments should be addressed to tr-admin@cs.unibo.it. UBLCS Technical Report Series 93-20 An Information Flow Security Property for CCS, R. Focardi, R. Gorrieri, October 1993. 93-21 A Classifica ..."
Abstract
-
Cited by 7 (2 self)
- Add to MetaCart
S. All local authors can be reached viae-mail at theaddress last-name@cs.unibo.it. Written requests and comments should be addressed to tr-admin@cs.unibo.it. UBLCS Technical Report Series 93-20 An Information Flow Security Property for CCS, R. Focardi, R. Gorrieri, October 1993. 93-21 A Classification of Security Properties, R. Focardi, R. Gorrieri, October 1993. 93-22 Real Time Systems: A Tutorial, F. Panzieri, R. Davoli, October 1993. 93-23 A Scalable Architecture for Reliable Distributed Multimedia Applications, F. Panzieri, M. Roccetti, October 1993. 93-24 Wide-Area Distribution Issues in Hypertext Systems, C. Maioli, S. Sola, F. Vitali, October 1993. 93-25 On Relating Some Models for Concurrency, P. Degano, R. Gorrieri, S. Vigna, October 1993. 93-26 Axiomatising ST Bisimulation Equivalence, N. Busi, R. van Glabbeek, R. Gorrieri, December 1993. 93-27 A Theory of Processeswith Durational Actions, R. Gorrieri, M. Roccetti, E. Stancampiano, December1993. 94-1 Further Modifications t...
Extending Partial Combinatory Algebras
, 1999
"... Introduction Consider a structure A = hA; s; k; \Deltai, where A is some set containing the distinguished elements s; k, equipped with a binary operation \Delta on A, called application, which may be partial. Notation 1.1. 1 Instead of a \Delta b we write ab; and in writing applicative expression ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
Introduction Consider a structure A = hA; s; k; \Deltai, where A is some set containing the distinguished elements s; k, equipped with a binary operation \Delta on A, called application, which may be partial. Notation 1.1. 1 Instead of a \Delta b we write ab; and in writing applicative expressions, the usual convention of association to the left is employed. So for elements a; b; c 2 A, the expression aba(ac) is short for ((a \Delta b) \Delta a) \Delta (a \Delta c). 2 ab # will mean that ab is defined; ab " means that ab is not defined. Obviously, an applicative expression

