1532 search results - page 107 / 307 » An Algebraic Process Calculus |
171
click to vote
SIGCOMM
2012
ACM
13 years 6 months ago
2012
ACM
ACM Sigcomm 2006 published a paper [26] which was perceived to unify the deterministic and stochastic branches of the network calculus (abbreviated throughout as DNC and SNC) [39]...
135
click to vote
APLAS
2007
ACM
15 years 8 months ago
2007
ACM
We have built the first family of tagless interpretations for a higher-order typed object language in a typed metalanguage (Haskell or ML) that require no dependent types, general...
140
click to vote
LFP
1990
15 years 5 months ago
1990
PCF, as considered in this paper, is a lazy typed lambda calculus with functions, pairing, fixed-point operators and arbitrary algebraic data types. The natural equational axioms ...
121
click to vote
LISP
2006
15 years 4 months ago
2006
In this paper we survey some well-known approaches proposed as general models for calculi dealing with names (like for example process calculi with name-passing). We focus on (pre)...
168
click to vote
SEFM
2007
IEEE
15 years 10 months ago
2007
IEEE
This paper presents an implicitly-typed functional, aspect-oriented programming language: λ AOP. The main contribution of the paper is a semantics for λ AOP advice weaving. The ...